Base | Representation |
---|---|
bin | 10110101111010111100010… |
… | …111001100010010101011101 |
3 | 111010010001202121122112212120 |
4 | 112233113202321202111131 |
5 | 101102044310234033041 |
6 | 552412533405053153 |
7 | 30031431400260501 |
oct | 2657274271422535 |
9 | 433101677575776 |
10 | 100012120221021 |
11 | 299599a1610668 |
12 | b2730288571b9 |
13 | 43a6144181168 |
14 | 1a9a8807a6301 |
15 | b8682888b366 |
hex | 5af5e2e6255d |
100012120221021 has 8 divisors (see below), whose sum is σ = 133390893669984. Its totient is φ = 66654046793040.
The previous prime is 100012120220981. The next prime is 100012120221037. The reversal of 100012120221021 is 120122021210001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100012120221021 - 217 = 100012120089949 is a prime.
It is a super-2 number, since 2×1000121202210212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100012120221521) 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, 5174993971 + ... + 5175013296.
It is an arithmetic number, because the mean of its divisors is an integer number (16673861708748).
Almost surely, 2100012120221021 is an apocalyptic number.
It is an amenable number.
100012120221021 is a deficient number, since it is larger than the sum of its proper divisors (33378773448963).
100012120221021 is a wasteful number, since it uses less digits than its factorization.
100012120221021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10350010491.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 100012120221021 its reverse (120122021210001), we get a palindrome (220134141431022).
The spelling of 100012120221021 in words is "one hundred trillion, twelve billion, one hundred twenty million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •