Base | Representation |
---|---|
bin | 10110110000110010101110… |
… | …110001101111101001111010 |
3 | 111010110102111010012020000101 |
4 | 112300302232301233221322 |
5 | 101110200320140323002 |
6 | 552525525103430014 |
7 | 30041465603615314 |
oct | 2660625661575172 |
9 | 433412433166011 |
10 | 100110030011002 |
11 | 29997475094a70 |
12 | b289bb25b530a |
13 | 43b244891cb2b |
14 | 1aa14cbda87b4 |
15 | b89159344587 |
hex | 5b0caec6fa7a |
100110030011002 has 64 divisors (see below), whose sum is σ = 170553804664320. Its totient is φ = 43670792692800.
The previous prime is 100110030010999. The next prime is 100110030011021. The reversal of 100110030011002 is 200110030011001.
It is a super-2 number, since 2×1001100300110022 (a number of 29 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 100110030011002.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 109666477 + ... + 110575567.
It is an arithmetic number, because the mean of its divisors is an integer number (2664903197880).
Almost surely, 2100110030011002 is an apocalyptic number.
100110030011002 is a deficient number, since it is larger than the sum of its proper divisors (70443774653318).
100110030011002 is a wasteful number, since it uses less digits than its factorization.
100110030011002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 911179.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 100110030011002 its reverse (200110030011001), we get a palindrome (300220060022003).
Subtracting 100110030011002 from its reverse (200110030011001), we obtain a palindrome (99999999999999).
The spelling of 100110030011002 in words is "one hundred trillion, one hundred ten billion, thirty million, eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •