Base | Representation |
---|---|
bin | 10110110010000111011101… |
… | …101010110000011000010010 |
3 | 111010210010022202000102022120 |
4 | 112302013131222300120102 |
5 | 101113143132310140310 |
6 | 553035413050315110 |
7 | 30051166314502302 |
oct | 2662073552603022 |
9 | 433703282012276 |
10 | 100201011021330 |
11 | 29a2201253969a |
12 | b2a3763a28a96 |
13 | 43babb7a6099b |
14 | 1aa5a7d2ad602 |
15 | b8b6d18a0b70 |
hex | 5b21ddab0612 |
100201011021330 has 32 divisors (see below), whose sum is σ = 245019830727744. Its totient is φ = 26216113574976.
The previous prime is 100201011021301. The next prime is 100201011021361. The reversal of 100201011021330 is 33120110102001.
It is a happy number.
It is a super-2 number, since 2×1002010110213302 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31509750304 + ... + 31509753483.
It is an arithmetic number, because the mean of its divisors is an integer number (7656869710242).
Almost surely, 2100201011021330 is an apocalyptic number.
100201011021330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100201011021330 is an abundant number, since it is smaller than the sum of its proper divisors (144818819706414).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100201011021330 is a wasteful number, since it uses less digits than its factorization.
100201011021330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63019503850.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 100201011021330 its reverse (33120110102001), we get a palindrome (133321121123331).
The spelling of 100201011021330 in words is "one hundred trillion, two hundred one billion, eleven million, twenty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •