Base | Representation |
---|---|
bin | 10110110000111100111110… |
… | …011100100110110000001101 |
3 | 111010111110212202012222112011 |
4 | 112300330332130212300031 |
5 | 101110340332230320323 |
6 | 552534544422341221 |
7 | 30042335316001354 |
oct | 2660747634466015 |
9 | 433443782188464 |
10 | 100121030323213 |
11 | 299a10aa516389 |
12 | b29016258a811 |
13 | 43b34ac926603 |
14 | 1aa1c52d1a99b |
15 | b8959ee4620d |
hex | 5b0f3e726c0d |
100121030323213 has 8 divisors (see below), whose sum is σ = 101307427309440. Its totient is φ = 98941029008640.
The previous prime is 100121030323187. The next prime is 100121030323219. The reversal of 100121030323213 is 312323030121001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100121030323213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100121030323219) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1598886420 + ... + 1598949037.
It is an arithmetic number, because the mean of its divisors is an integer number (12663428413680).
Almost surely, 2100121030323213 is an apocalyptic number.
It is an amenable number.
100121030323213 is a deficient number, since it is larger than the sum of its proper divisors (1186396986227).
100121030323213 is a wasteful number, since it uses less digits than its factorization.
100121030323213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3197835827.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 100121030323213 its reverse (312323030121001), we get a palindrome (412444060444214).
The spelling of 100121030323213 in words is "one hundred trillion, one hundred twenty-one billion, thirty million, three hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •