Base | Representation |
---|---|
bin | 10110110010010010101010… |
… | …001000100110100101111111 |
3 | 111010211021100110100110222022 |
4 | 112302102222020212211333 |
5 | 101113342242010112343 |
6 | 553045121523310355 |
7 | 30052103223451415 |
oct | 2662225210464577 |
9 | 433737313313868 |
10 | 100213031332223 |
11 | 29a27120703127 |
12 | b2a5b5951b3bb |
13 | 43bc082187294 |
14 | 1aa649d8972b5 |
15 | b8bb86cd4568 |
hex | 5b24aa22697f |
100213031332223 has 12 divisors (see below), whose sum is σ = 105765407247528. Its totient is φ = 94938295546800.
The previous prime is 100213031332157. The next prime is 100213031332231. The reversal of 100213031332223 is 322233130312001.
It is not a de Polignac number, because 100213031332223 - 28 = 100213031331967 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100213031332192 and 100213031332201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100213031332283) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 159863240 + ... + 160488882.
It is an arithmetic number, because the mean of its divisors is an integer number (8813783937294).
Almost surely, 2100213031332223 is an apocalyptic number.
100213031332223 is a deficient number, since it is larger than the sum of its proper divisors (5552375915305).
100213031332223 is an equidigital number, since it uses as much as digits as its factorization.
100213031332223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1069382 (or 1069363 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 100213031332223 its reverse (322233130312001), we get a palindrome (422446161644224).
The spelling of 100213031332223 in words is "one hundred trillion, two hundred thirteen billion, thirty-one million, three hundred thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •