Base | Representation |
---|---|
bin | 111000110100010… |
… | …1101100110110100 |
3 | 11220212102010120000 |
4 | 1301220231212310 |
5 | 12401030413342 |
6 | 513102511300 |
7 | 65146652061 |
oct | 16150554664 |
9 | 4825363500 |
10 | 1906497972 |
11 | 899194165 |
12 | 452595530 |
13 | 244c9a412 |
14 | 1412b9c68 |
15 | b259344c |
hex | 71a2d9b4 |
1906497972 has 30 divisors (see below), whose sum is σ = 4983963138. Its totient is φ = 635499216.
The previous prime is 1906497911. The next prime is 1906497973. The reversal of 1906497972 is 2797946091.
It can be written as a sum of positive squares in only one way, i.e., 1438381476 + 468116496 = 37926^2 + 21636^2 .
It is a super-2 number, since 2×19064979722 = 7269469034480225568, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1906497973) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 2941803 + ... + 2942450.
Almost surely, 21906497972 is an apocalyptic number.
1906497972 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1906497972 is an abundant number, since it is smaller than the sum of its proper divisors (3077465166).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1906497972 is a wasteful number, since it uses less digits than its factorization.
1906497972 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5884269 (or 5884258 counting only the distinct ones).
The product of its (nonzero) digits is 1714608, while the sum is 54.
The square root of 1906497972 is about 43663.4626661698. The cubic root of 1906497972 is about 1239.9726780314.
The spelling of 1906497972 in words is "one billion, nine hundred six million, four hundred ninety-seven thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •