Base | Representation |
---|---|
bin | 101110101101100100… |
… | …0111010111101011001 |
3 | 100120221000012022001002 |
4 | 1131123020322331121 |
5 | 3120420202004423 |
6 | 114025554234345 |
7 | 10150600043546 |
oct | 1353310727531 |
9 | 316830168032 |
10 | 100313313113 |
11 | 395a7282962 |
12 | 175368859b5 |
13 | 95c86bc110 |
14 | 4bd88dbbcd |
15 | 29219c8228 |
hex | 175b23af59 |
100313313113 has 8 divisors (see below), whose sum is σ = 110068019208. Its totient is φ = 90849792384.
The previous prime is 100313313101. The next prime is 100313313151. The reversal of 100313313113 is 311313313001.
It can be written as a sum of positive squares in 4 ways, for example, as 50523664 + 100262789449 = 7108^2 + 316643^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100313313113 - 28 = 100313312857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100313313413) 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, 72795620 + ... + 72796997.
It is an arithmetic number, because the mean of its divisors is an integer number (13758502401).
Almost surely, 2100313313113 is an apocalyptic number.
100313313113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
100313313113 is a deficient number, since it is larger than the sum of its proper divisors (9754706095).
100313313113 is a wasteful number, since it uses less digits than its factorization.
100313313113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145592683.
The product of its (nonzero) digits is 243, while the sum is 20.
Adding to 100313313113 its reverse (311313313001), we get a palindrome (411626626114).
The spelling of 100313313113 in words is "one hundred billion, three hundred thirteen million, three hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •