Base | Representation |
---|---|
bin | 10110101111100001111110… |
… | …000000000011000111001100 |
3 | 111010011010122121120122202020 |
4 | 112233201332000003013030 |
5 | 101102240220424044322 |
6 | 552422024134530140 |
7 | 30032305631530404 |
oct | 2657417600030714 |
9 | 433133577518666 |
10 | 100023312331212 |
11 | 29963715232706 |
12 | b275230b06950 |
13 | 43a7208b2c87a |
14 | 1a9b222da3804 |
15 | b86c8122705c |
hex | 5af87e0031cc |
100023312331212 has 24 divisors (see below), whose sum is σ = 233914563387456. Its totient is φ = 33265842022608.
The previous prime is 100023312331183. The next prime is 100023312331219. The reversal of 100023312331212 is 212133213320001.
It is not an unprimeable number, because it can be changed into a prime (100023312331219) 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, 9407755438 + ... + 9407766069.
It is an arithmetic number, because the mean of its divisors is an integer number (9746440141144).
Almost surely, 2100023312331212 is an apocalyptic number.
100023312331212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100023312331212 is an abundant number, since it is smaller than the sum of its proper divisors (133891251056244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100023312331212 is a wasteful number, since it uses less digits than its factorization.
100023312331212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18815521957 (or 18815521955 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 100023312331212 its reverse (212133213320001), we get a palindrome (312156525651213).
The spelling of 100023312331212 in words is "one hundred trillion, twenty-three billion, three hundred twelve million, three hundred thirty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •