Base | Representation |
---|---|
bin | 10110101111101010010000… |
… | …100001111001111101110011 |
3 | 111010011222121221000010211012 |
4 | 112233222100201321331303 |
5 | 101102411433030143443 |
6 | 552430055253541135 |
7 | 30033042331220360 |
oct | 2657522041717563 |
9 | 433158557003735 |
10 | 100032213131123 |
11 | 29967472529399 |
12 | b276ab59447ab |
13 | 43a7cc6b89490 |
14 | 1a9b829155467 |
15 | b8710285b118 |
hex | 5afa90879f73 |
100032213131123 has 32 divisors (see below), whose sum is σ = 123840926090112. Its totient is φ = 78680802816000.
The previous prime is 100032213131111. The next prime is 100032213131141. The reversal of 100032213131123 is 321131312230001.
It is not a de Polignac number, because 100032213131123 - 224 = 100032196353907 is a prime.
It is a super-2 number, since 2×1000322131311232 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100032213431123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 155550563 + ... + 156192323.
It is an arithmetic number, because the mean of its divisors is an integer number (3870028940316).
Almost surely, 2100032213131123 is an apocalyptic number.
100032213131123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
100032213131123 is a deficient number, since it is larger than the sum of its proper divisors (23808712958989).
100032213131123 is a wasteful number, since it uses less digits than its factorization.
100032213131123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 651855.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 100032213131123 its reverse (321131312230001), we get a palindrome (421163525361124).
The spelling of 100032213131123 in words is "one hundred trillion, thirty-two billion, two hundred thirteen million, one hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •