Base | Representation |
---|---|
bin | 10110110001000110100011… |
… | …001110011001011110010110 |
3 | 111010112110102020012010000012 |
4 | 112301012203032121132112 |
5 | 101111022411111012324 |
6 | 552543404513520222 |
7 | 30043151142406040 |
oct | 2661064316313626 |
9 | 433473366163005 |
10 | 100131311032214 |
11 | 299a54a5729200 |
12 | b292151573072 |
13 | 43b445a819087 |
14 | 1aa254a470a90 |
15 | b899a27a220e |
hex | 5b11a3399796 |
100131311032214 has 192 divisors, whose sum is σ = 201418191184896. Its totient is φ = 36416286720000.
The previous prime is 100131311032183. The next prime is 100131311032223. The reversal of 100131311032214 is 412230113131001.
It is a super-2 number, since 2×1001313110322142 (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 100131311032214.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2787369257 + ... + 2787405179.
It is an arithmetic number, because the mean of its divisors is an integer number (1049053079088).
Almost surely, 2100131311032214 is an apocalyptic number.
100131311032214 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
100131311032214 is an abundant number, since it is smaller than the sum of its proper divisors (101286880152682).
100131311032214 is a wasteful number, since it uses less digits than its factorization.
100131311032214 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36763 (or 36752 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 100131311032214 its reverse (412230113131001), we get a palindrome (512361424163215).
The spelling of 100131311032214 in words is "one hundred trillion, one hundred thirty-one billion, three hundred eleven million, thirty-two thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •