Base | Representation |
---|---|
bin | 101110100100100010… |
… | …1011100110100000001 |
3 | 100120010220020101121222 |
4 | 1131021011130310001 |
5 | 3114310131211223 |
6 | 113535534124425 |
7 | 10140231326006 |
oct | 1351105346401 |
9 | 316126211558 |
10 | 100010413313 |
11 | 394612a8848 |
12 | 17471350715 |
13 | 957aa17475 |
14 | 4baa5b18ad |
15 | 29050e50c8 |
hex | 174915cd01 |
100010413313 has 16 divisors (see below), whose sum is σ = 106246998864. Its totient is φ = 93813657600.
The previous prime is 100010413303. The next prime is 100010413339. The reversal of 100010413313 is 313314010001.
It can be written as a sum of positive squares in 8 ways, for example, as 25730726464 + 74279686849 = 160408^2 + 272543^2 .
It is a cyclic number.
It is not a de Polignac number, because 100010413313 - 26 = 100010413249 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100010413291 and 100010413300.
It is not an unprimeable number, because it can be changed into a prime (100010413303) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6402713 + ... + 6418313.
It is an arithmetic number, because the mean of its divisors is an integer number (6640437429).
Almost surely, 2100010413313 is an apocalyptic number.
It is an amenable number.
100010413313 is a deficient number, since it is larger than the sum of its proper divisors (6236585551).
100010413313 is a wasteful number, since it uses less digits than its factorization.
100010413313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16852.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 100010413313 its reverse (313314010001), we get a palindrome (413324423314).
The spelling of 100010413313 in words is "one hundred billion, ten million, four hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •