Base | Representation |
---|---|
bin | 10110110000100010111001… |
… | …100100100010110101110110 |
3 | 111010101210121102222201101212 |
4 | 112300202321210202311312 |
5 | 101104411011443341323 |
6 | 552514034224521422 |
7 | 30040324423434422 |
oct | 2660427144426566 |
9 | 433353542881355 |
10 | 100093031230838 |
11 | 29990241789918 |
12 | b286849780272 |
13 | 43b0969c65a29 |
14 | 1aa0758525b82 |
15 | b889b1d0db78 |
hex | 5b08b9922d76 |
100093031230838 has 4 divisors (see below), whose sum is σ = 150139546846260. Its totient is φ = 50046515615418.
The previous prime is 100093031230837. The next prime is 100093031230847. The reversal of 100093031230838 is 838032130390001.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1000930312308382 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100093031230795 and 100093031230804.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100093031230837) 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 as a sum of consecutive naturals, namely, 25023257807708 + ... + 25023257807711.
It is an arithmetic number, because the mean of its divisors is an integer number (37534886711565).
Almost surely, 2100093031230838 is an apocalyptic number.
100093031230838 is a deficient number, since it is larger than the sum of its proper divisors (50046515615422).
100093031230838 is an equidigital number, since it uses as much as digits as its factorization.
100093031230838 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50046515615421.
The product of its (nonzero) digits is 93312, while the sum is 41.
The spelling of 100093031230838 in words is "one hundred trillion, ninety-three billion, thirty-one million, two hundred thirty thousand, eight hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •