Recognised as Number
3,472,725
- Positive
- Odd
- Composite
- 7 digits
3,472,725 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,472,725
Digit count7
Digit sum30
Digit product11,760
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 5^2 × 19 × 2,437
Distinct prime factors43, 5, 19, 2,437
Number of divisors24
Sum of divisors σ(n)6,046,240
Aliquot sum2,573,515sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,753,920integers below n that share no factor with it
Carmichael function λ(n)36,540the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,753,920
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 15, 19, 25, 57, 75, 95, 285, 475, 1,425, 2,437, 7,311, 12,185, 36,555, 46,303, 60,925, 138,909, 182,775, 231,515, 694,545, 1,157,575, 3,472,72524 in total
Arithmetic
Previous number3,472,724
Next number3,472,726
Double6,945,450
Half1,736,362.5
Square12,059,818,925,625
Cube41,880,434,678,491,078,125
Square root1,863.524885801≈irrational, shown to 9 decimal places
Cube root151.434024579≈
Negation-3,472,725
Reciprocal2.87958304 × 10^-7≈
Representations
Decimal3,472,725
Binary110100111111010101010122 bits
Octal15176525
Hexadecimal34FD55
Base 3622FKL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and seventy-two thousand, seven hundred and twenty-five
Ordinalthree million, four hundred and seventy-two thousand, seven hundred and twenty-fifth
Scientific notation3.472725 × 10^6
Engineering notation3.472725 × 10^6
In other bases
Ternary20112102200110base 3; the most digit-efficient integer base after e: 14 digits
Quinary1342111400base 5; one hand: 10 digits
Septenary41342364base 7: 8 digits
Nonary6472613base 9; each digit is two ternary digits: 7 digits
Duodecimal11b5819base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11e1g5base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:4:38:45base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TTT110T00110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101010000110101010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101001111110101010101
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 set bits, so even; 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
Bytes334 fd 55
Gray code1011101000001111111111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101001111110101010101
64-bit0000000000000000000000000000000000000000001101001111110101010101
One's complement11111111110010110000001010101010at 32 bits, every bit flipped
Bits reversed10101010101111110010110000000000at 32 bits
Rotated left by 100000000011010011111101010101010at 32 bits, wrapping
Shifted left by 111010011111101010101010= 6,945,450, no wrap
Shifted right by 1110100111111010101010= 1,736,362, discarding the low bit
These bits as a double1.71575412 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,472,725 to the power 212,059,818,925,625
3,472,725 to the power 341,880,434,678,491,078,125
3,472,725 to the power 4145,439,232,518,862,929,281,640,625
3,472,725 to the power 5505,070,458,749,068,266,089,585,439,453,125
First ten multiples3,472,725, 6,945,450, 10,418,175, 13,890,900, 17,363,625, 20,836,350, 24,309,075, 27,781,800, 31,254,525, 34,727,250
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 5
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 25
Collatz (3n + 1) trajectory
Steps to reach 1190the total stopping time
Highest value reached10,418,1763× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,472,725 → 10,418,176 → 5,209,088 → 2,604,544 → 1,302,272 → 651,136 → 325,568 → 162,784 → 81,392 → 40,696 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage347,272,500%
3,472,725% as a decimal34,727.25
3,472,725% of 1003,472,725
3,472,725% of 1,00034,727,250
As a fraction of 1003,472,725/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,472,725
Nerdulate something else
Nothing in mind? Surprise me · today’s page