Base | Representation |
---|---|
bin | 11101111110101101110… |
… | …00011011101000010000 |
3 | 10122110212121012202201111 |
4 | 32333112320123220100 |
5 | 113334122142114300 |
6 | 2105120015143104 |
7 | 134264616043060 |
oct | 16772670335020 |
9 | 3573777182644 |
10 | 1030102301200 |
11 | 367955992375 |
12 | 147783214a94 |
13 | 761a48cb99b |
14 | 37c002c13a0 |
15 | 1bbde34b9ba |
hex | efd6e1ba10 |
1030102301200 has 120 divisors (see below), whose sum is σ = 2840828121792. Its totient is φ = 351621864960.
The previous prime is 1030102301149. The next prime is 1030102301227. The reversal of 1030102301200 is 21032010301.
It is a super-2 number, since 2×10301023012002 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 174739 + ... + 1445938.
Almost surely, 21030102301200 is an apocalyptic number.
1030102301200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1030102301200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1420414060896).
1030102301200 is an abundant number, since it is smaller than the sum of its proper divisors (1810725820592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030102301200 is a wasteful number, since it uses less digits than its factorization.
1030102301200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1620929 (or 1620918 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 1030102301200 its reverse (21032010301), we get a palindrome (1051134311501).
The spelling of 1030102301200 in words is "one trillion, thirty billion, one hundred two million, three hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •