Base | Representation |
---|---|
bin | 10110101111101010001001… |
… | …110110100011001000101011 |
3 | 111010011222100010012110220222 |
4 | 112233222021312203020223 |
5 | 101102411220340231443 |
6 | 552430040212440255 |
7 | 30033036501045251 |
oct | 2657521166431053 |
9 | 433158303173828 |
10 | 100032101102123 |
11 | 29967415271343 |
12 | b276a8431908b |
13 | 43a7ca98c3728 |
14 | 1a9b8183125d1 |
15 | b870e7acc468 |
hex | 5afa89da322b |
100032101102123 has 8 divisors (see below), whose sum is σ = 100038994662096. Its totient is φ = 100025207840800.
The previous prime is 100032101102119. The next prime is 100032101102137. The reversal of 100032101102123 is 321201101230001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100032101102123 - 22 = 100032101102119 is a prime.
It is a super-2 number, since 2×1000321011021232 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100032101107123) 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, 1320117065 + ... + 1320192837.
It is an arithmetic number, because the mean of its divisors is an integer number (12504874332762).
Almost surely, 2100032101102123 is an apocalyptic number.
100032101102123 is a deficient number, since it is larger than the sum of its proper divisors (6893559973).
100032101102123 is an equidigital number, since it uses as much as digits as its factorization.
100032101102123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149325.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 100032101102123 its reverse (321201101230001), we get a palindrome (421233202332124).
The spelling of 100032101102123 in words is "one hundred trillion, thirty-two billion, one hundred one million, one hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •