Base | Representation |
---|---|
bin | 101110100100100100… |
… | …0111010101010011101 |
3 | 100120010221221120010112 |
4 | 1131021020322222131 |
5 | 3114310344301023 |
6 | 113540005415405 |
7 | 10140242132201 |
oct | 1351110725235 |
9 | 316127846115 |
10 | 100011322013 |
11 | 39461869539 |
12 | 1747170a565 |
13 | 957ac74c65 |
14 | 4baa76ab01 |
15 | 2905224478 |
hex | 174923aa9d |
100011322013 has 4 divisors (see below), whose sum is σ = 100030438908. Its totient is φ = 99992205120.
The previous prime is 100011322001. The next prime is 100011322039. The reversal of 100011322013 is 310223110001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 92870734009 + 7140588004 = 304747^2 + 84502^2 .
It is a cyclic number.
It is not a de Polignac number, because 100011322013 - 28 = 100011321757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100011322063) 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 3 ways as a sum of consecutive naturals, for example, 9550598 + ... + 9561063.
It is an arithmetic number, because the mean of its divisors is an integer number (25007609727).
Almost surely, 2100011322013 is an apocalyptic number.
It is an amenable number.
100011322013 is a deficient number, since it is larger than the sum of its proper divisors (19116895).
100011322013 is an equidigital number, since it uses as much as digits as its factorization.
100011322013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19116894.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 100011322013 its reverse (310223110001), we get a palindrome (410234432014).
The spelling of 100011322013 in words is "one hundred billion, eleven million, three hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •