Base | Representation |
---|---|
bin | 10110101111010111100011… |
… | …100011011111101000101011 |
3 | 111010010001210101100100122120 |
4 | 112233113203203133220223 |
5 | 101102044321043020021 |
6 | 552412534440522323 |
7 | 30031431562620513 |
oct | 2657274343375053 |
9 | 433101711310576 |
10 | 100012131220011 |
11 | 299599a784333a |
12 | b2730304803a3 |
13 | 43a614653263a |
14 | 1a9a88202a843 |
15 | b868298102c6 |
hex | 5af5e38dfa2b |
100012131220011 has 16 divisors (see below), whose sum is σ = 134035862989344. Its totient is φ = 66332314024704.
The previous prime is 100012131219989. The next prime is 100012131220033. The reversal of 100012131220011 is 110022131210001.
It is an interprime number because it is at equal distance from previous prime (100012131219989) and next prime (100012131220033).
It is not a de Polignac number, because 100012131220011 - 231 = 100009983736363 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100012131220411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 91610146 + ... + 92695431.
It is an arithmetic number, because the mean of its divisors is an integer number (8377241436834).
Almost surely, 2100012131220011 is an apocalyptic number.
100012131220011 is a deficient number, since it is larger than the sum of its proper divisors (34023731769333).
100012131220011 is a wasteful number, since it uses less digits than its factorization.
100012131220011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184306510.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 100012131220011 its reverse (110022131210001), we get a palindrome (210034262430012).
The spelling of 100012131220011 in words is "one hundred trillion, twelve billion, one hundred thirty-one million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •