Base | Representation |
---|---|
bin | 11110100110110100000… |
… | …11000100111100110000 |
3 | 10201112102220212101102111 |
4 | 33103122003010330300 |
5 | 114212214321310031 |
6 | 2123040130055104 |
7 | 135656243502310 |
oct | 17233203047460 |
9 | 3645386771374 |
10 | 1051630260016 |
11 | 375aa2958476 |
12 | 14b990a1a494 |
13 | 78225a0775b |
14 | 38c834a7440 |
15 | 1c54e2d61b1 |
hex | f4da0c4f30 |
1051630260016 has 20 divisors (see below), whose sum is σ = 2328609861712. Its totient is φ = 450698682816.
The previous prime is 1051630259989. The next prime is 1051630260019. The reversal of 1051630260016 is 6100620361501.
It is a super-2 number, since 2×10516302600162 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1051630260016.
It is not an unprimeable number, because it can be changed into a prime (1051630260019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4694777835 + ... + 4694778058.
Almost surely, 21051630260016 is an apocalyptic number.
1051630260016 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1051630260016 is an abundant number, since it is smaller than the sum of its proper divisors (1276979601696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1051630260016 is an equidigital number, since it uses as much as digits as its factorization.
1051630260016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9389555908 (or 9389555902 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 31.
The spelling of 1051630260016 in words is "one trillion, fifty-one billion, six hundred thirty million, two hundred sixty thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •