Base | Representation |
---|---|
bin | 101110100100101000… |
… | …0011110001000101001 |
3 | 100120011002200011120222 |
4 | 1131021100132020221 |
5 | 3114311401133223 |
6 | 113540120055425 |
7 | 10140265020521 |
oct | 1351120361051 |
9 | 316132604528 |
10 | 100013302313 |
11 | 394629a1351 |
12 | 17472304575 |
13 | 957b4b9432 |
14 | 4baab24681 |
15 | 29054b60c8 |
hex | 174941e229 |
100013302313 has 8 divisors (see below), whose sum is σ = 102428848896. Its totient is φ = 97622787600.
The previous prime is 100013302297. The next prime is 100013302369. The reversal of 100013302313 is 313203310001.
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 100013302313 - 24 = 100013302297 is a prime.
It is a super-2 number, since 2×1000133023132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100013302291 and 100013302300.
It is not an unprimeable number, because it can be changed into a prime (100013302393) 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, 6249881 + ... + 6265862.
It is an arithmetic number, because the mean of its divisors is an integer number (12803606112).
Almost surely, 2100013302313 is an apocalyptic number.
It is an amenable number.
100013302313 is a deficient number, since it is larger than the sum of its proper divisors (2415546583).
100013302313 is a wasteful number, since it uses less digits than its factorization.
100013302313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12515935.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 100013302313 its reverse (313203310001), we get a palindrome (413216612314).
The spelling of 100013302313 in words is "one hundred billion, thirteen million, three hundred two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •