Recognised as Number
4,229,479
- Positive
- Odd
- Prime
- 7 digits
4,229,479 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,229,479
Digit count7
Digit sum37
Digit product36,288
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,229,479
Distinct prime factors14,229,479
Number of divisors2
Sum of divisors σ(n)4,229,480
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,229,478integers below n that share no factor with it
Carmichael function λ(n)4,229,478the 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,229,4792 in total
Arithmetic
Previous number4,229,478
Next number4,229,480
Double8,458,958
Half2,114,739.5
Square17,888,492,611,441
Cube75,659,003,841,744,869,239
Square root2,056.569716786≈irrational, shown to 9 decimal places
Cube root161.719463159≈
Negation-4,229,479
Reciprocal2.36435741 × 10^-7≈
Representations
Decimal4,229,479
Binary1000000100010010110011123 bits
Octal20104547
Hexadecimal408967
Base 362INHJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, two hundred and twenty-nine thousand, four hundred and seventy-nine
Ordinalfour million, two hundred and twenty-nine thousand, four hundred and seventy-ninth
Scientific notation4.229479 × 10^6
Engineering notation4.229479 × 10^6
In other bases
Ternary21221212202101base 3; the most digit-efficient integer base after e: 14 digits
Quinary2040320404base 5; one hand: 10 digits
Septenary50643562base 7: 8 digits
Nonary7855671base 9; each digit is two ternary digits: 7 digits
Duodecimal14bb747base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal168ddjbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:34:51:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T00T0T0T1T101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000011001111010111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000001000100101100111
Bit length23 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits14within that length
Bit parityodd9 set bits, so odd; 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
Bytes340 89 67
Gray code11000001100110111010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000001000100101100111
64-bit0000000000000000000000000000000000000000010000001000100101100111
One's complement11111111101111110111011010011000at 32 bits, every bit flipped
Bits reversed11100110100100010000001000000000at 32 bits
Rotated left by 100000000100000010001001011001110at 32 bits, wrapping
Shifted left by 1100000010001001011001110= 8,458,958, no wrap
Shifted right by 11000000100010010110011= 2,114,739, discarding the low bit
These bits as a double2.08964027 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,229,479 to the power 217,888,492,611,441
4,229,479 to the power 375,659,003,841,744,869,239
4,229,479 to the power 4319,998,167,909,579,247,804,096,481
4,229,479 to the power 51,353,425,531,212,039,327,423,222,180,363,399
First ten multiples4,229,479, 8,458,958, 12,688,437, 16,917,916, 21,147,395, 25,376,874, 29,606,353, 33,835,832, 38,065,311, 42,294,790
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1198the total stopping time
Highest value reached108,396,95225× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,229,479 → 12,688,438 → 6,344,219 → 19,032,658 → 9,516,329 → 28,548,988 → 14,274,494 → 7,137,247 → 21,411,742 → 10,705,871 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage422,947,900%
4,229,479% as a decimal42,294.79
4,229,479% of 1004,229,479
4,229,479% of 1,00042,294,790
As a fraction of 1004,229,479/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,229,479
Nerdulate something else
Nothing in mind? Surprise me · today’s page