Recognised as Number
4,626,247
- Positive
- Odd
- Prime
- 7 digits
4,626,247 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,626,247
Digit count7
Digit sum31
Digit product16,128
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,626,247
Distinct prime factors14,626,247
Number of divisors2
Sum of divisors σ(n)4,626,248
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,626,246integers below n that share no factor with it
Carmichael function λ(n)4,626,246the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 4,626,2472 in total
Arithmetic
Previous number4,626,246
Next number4,626,248
Double9,252,494
Half2,313,123.5
Square21,402,161,305,009
Cube99,011,684,530,813,971,223
Square root2,150.871218832≈irrational, shown to 9 decimal places
Cube root166.626065221≈
Negation-4,626,247
Reciprocal2.16157935 × 10^-7≈
Representations
Decimal4,626,247
Binary1000110100101110100011123 bits
Octal21513507
Hexadecimal469747
Base 362R5MV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, six hundred and twenty-six thousand, two hundred and forty-seven
Ordinalfour million, six hundred and twenty-six thousand, two hundred and forty-seventh
Scientific notation4.626247 × 10^6
Engineering notation4.626247 × 10^6
In other bases
Ternary22201001000111base 3; the most digit-efficient integer base after e: 14 digits
Quinary2141014442base 5; one hand: 10 digits
Septenary54215413base 7: 8 digits
Nonary8631014base 9; each digit is two ternary digits: 7 digits
Duodecimal1671287base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal18i5c7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:25:4:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T01001000111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110111110101101011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010001101001011101000111
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes346 97 47
Gray code11001011101110011100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010001101001011101000111
64-bit0000000000000000000000000000000000000000010001101001011101000111
One's complement11111111101110010110100010111000at 32 bits, every bit flipped
Bits reversed11100010111010010110001000000000at 32 bits
Rotated left by 100000000100011010010111010001110at 32 bits, wrapping
Shifted left by 1100011010010111010001110= 9,252,494, no wrap
Shifted right by 11000110100101110100011= 2,313,123, discarding the low bit
These bits as a double2.28566971 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,626,247 to the power 221,402,161,305,009
4,626,247 to the power 399,011,684,530,813,971,223
4,626,247 to the power 4458,052,508,525,624,541,928,490,081
4,626,247 to the power 52,119,064,043,409,144,960,223,051,451,756,007
First ten multiples4,626,247, 9,252,494, 13,878,741, 18,504,988, 23,131,235, 27,757,482, 32,383,729, 37,009,976, 41,636,223, 46,262,470
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1255the total stopping time
Highest value reached39,521,8968× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,626,247 → 13,878,742 → 6,939,371 → 20,818,114 → 10,409,057 → 31,227,172 → 15,613,586 → 7,806,793 → 23,420,380 → 11,710,190 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage462,624,700%
4,626,247% as a decimal46,262.47
4,626,247% of 1004,626,247
4,626,247% of 1,00046,262,470
As a fraction of 1004,626,247/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 4,626,247
Nerdulate something else
Nothing in mind? Surprise me · today’s page