Base | Representation |
---|---|
bin | 101110100100101000… |
… | …0011110010011101101 |
3 | 100120011002200012120012 |
4 | 1131021100132103231 |
5 | 3114311401144041 |
6 | 113540120103005 |
7 | 10140265022552 |
oct | 1351120362355 |
9 | 316132605505 |
10 | 100013303021 |
11 | 394629a1935 |
12 | 17472304a65 |
13 | 957b4b9858 |
14 | 4baab24a29 |
15 | 29054b63eb |
hex | 174941e4ed |
100013303021 has 8 divisors (see below), whose sum is σ = 100839229440. Its totient is φ = 99187977168.
The previous prime is 100013302967. The next prime is 100013303053. The reversal of 100013303021 is 120303310001.
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 100013303021 - 26 = 100013302957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100013302987 and 100013303005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100013303521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 187415 + ... + 484923.
It is an arithmetic number, because the mean of its divisors is an integer number (12604903680).
Almost surely, 2100013303021 is an apocalyptic number.
It is an amenable number.
100013303021 is a deficient number, since it is larger than the sum of its proper divisors (825926419).
100013303021 is a wasteful number, since it uses less digits than its factorization.
100013303021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300283.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 100013303021 its reverse (120303310001), we get a palindrome (220316613022).
The spelling of 100013303021 in words is "one hundred billion, thirteen million, three hundred three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •