Recognised as Number
3,250,429
- Positive
- Odd
- Composite
- 7 digits
3,250,429 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,250,429
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 13 × 23 × 1,553
Distinct prime factors47, 13, 23, 1,553
Number of divisors16
Sum of divisors σ(n)4,177,152
Aliquot sum926,723sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,458,368integers below n that share no factor with it
Carmichael function λ(n)51,216the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,458,368
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 13, 23, 91, 161, 299, 1,553, 2,093, 10,871, 20,189, 35,719, 141,323, 250,033, 464,347, 3,250,42916 in total
Arithmetic
Previous number3,250,428
Next number3,250,430
Double6,500,858
Half1,625,214.5
Square10,565,288,684,041
Cube34,341,720,731,978,703,589
Square root1,802.894616998≈irrational, shown to 9 decimal places
Cube root148.131320625≈
Negation-3,250,429
Reciprocal3.07651698 × 10^-7≈
Representations
Decimal3,250,429
Binary110001100110001111110122 bits
Octal14314375
Hexadecimal3198FD
Base 361XO1P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, two hundred and fifty thousand, four hundred and twenty-nine
Ordinalthree million, two hundred and fifty thousand, four hundred and twenty-ninth
Scientific notation3.250429 × 10^6
Engineering notation3.250429 × 10^6
In other bases
Ternary20010010202021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1313003204base 5; one hand: 10 digits
Septenary36425320base 7: 8 digits
Nonary6103667base 9; each digit is two ternary digits: 7 digits
Duodecimal1109051base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal106619base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:2:53:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0010011T1T1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101101110100100001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100011001100011111101
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes331 98 fd
Gray code1010010101010010000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100011001100011111101
64-bit0000000000000000000000000000000000000000001100011001100011111101
One's complement11111111110011100110011100000010at 32 bits, every bit flipped
Bits reversed10111111000110011000110000000000at 32 bits
Rotated left by 100000000011000110011000111111010at 32 bits, wrapping
Shifted left by 111000110011000111111010= 6,500,858, no wrap
Shifted right by 1110001100110001111110= 1,625,214, discarding the low bit
These bits as a double1.6059253 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,250,429 to the power 210,565,288,684,041
3,250,429 to the power 334,341,720,731,978,703,589
3,250,429 to the power 4111,625,324,977,124,805,528,089,681
3,250,429 to the power 5362,830,193,440,070,804,507,863,013,723,149
First ten multiples3,250,429, 6,500,858, 9,751,287, 13,001,716, 16,252,145, 19,502,574, 22,753,003, 26,003,432, 29,253,861, 32,504,290
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached18,512,2245× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,250,429 → 9,751,288 → 4,875,644 → 2,437,822 → 1,218,911 → 3,656,734 → 1,828,367 → 5,485,102 → 2,742,551 → 8,227,654 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage325,042,900%
3,250,429% as a decimal32,504.29
3,250,429% of 1003,250,429
3,250,429% of 1,00032,504,290
As a fraction of 1003,250,429/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 3,250,429
Nerdulate something else
Nothing in mind? Surprise me · today’s page