Base | Representation |
---|---|
bin | 111101011110111… |
… | …011111100001100 |
3 | 2122212222122102220 |
4 | 331132323330030 |
5 | 4103032120022 |
6 | 250205015340 |
7 | 34363526655 |
oct | 7536737414 |
9 | 2585878386 |
10 | 1031520012 |
11 | 48a2a2286 |
12 | 249554550 |
13 | 135924c93 |
14 | 9add452c |
15 | 6085a85c |
hex | 3d7bbf0c |
1031520012 has 12 divisors (see below), whose sum is σ = 2406880056. Its totient is φ = 343840000.
The previous prime is 1031520011. The next prime is 1031520041. The reversal of 1031520012 is 2100251301.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 1031519973 and 1031520000.
It is not an unprimeable number, because it can be changed into a prime (1031520011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42979989 + ... + 42980012.
It is an arithmetic number, because the mean of its divisors is an integer number (200573338).
Almost surely, 21031520012 is an apocalyptic number.
1031520012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1031520012 is an abundant number, since it is smaller than the sum of its proper divisors (1375360044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031520012 is a wasteful number, since it uses less digits than its factorization.
1031520012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85960008 (or 85960006 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 1031520012 is about 32117.2852526486. The cubic root of 1031520012 is about 1010.3981738892.
Adding to 1031520012 its reverse (2100251301), we get a palindrome (3131771313).
The spelling of 1031520012 in words is "one billion, thirty-one million, five hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •