Base | Representation |
---|---|
bin | 10110110010100010100100… |
… | …000111110010111010001011 |
3 | 111010212220102201111021112121 |
4 | 112302202210013302322023 |
5 | 101114132231220421121 |
6 | 553101024345352111 |
7 | 30053246366506402 |
oct | 2662424407627213 |
9 | 433786381437477 |
10 | 100230110326411 |
11 | 29a3339531625a |
12 | b2a9325198637 |
13 | 43c0874647cc0 |
14 | 1aa723dc5a639 |
15 | b8c3363b2141 |
hex | 5b28a41f2e8b |
100230110326411 has 8 divisors (see below), whose sum is σ = 112633167457440. Its totient is φ = 88497488716032.
The previous prime is 100230110326403. The next prime is 100230110326483. The reversal of 100230110326411 is 114623011032001.
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 100230110326411 - 23 = 100230110326403 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100230110326111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 167608879846 + ... + 167608880443.
It is an arithmetic number, because the mean of its divisors is an integer number (14079145932180).
Almost surely, 2100230110326411 is an apocalyptic number.
100230110326411 is a deficient number, since it is larger than the sum of its proper divisors (12403057131029).
100230110326411 is a wasteful number, since it uses less digits than its factorization.
100230110326411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335217760325.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 100230110326411 its reverse (114623011032001), we get a palindrome (214853121358412).
The spelling of 100230110326411 in words is "one hundred trillion, two hundred thirty billion, one hundred ten million, three hundred twenty-six thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •