Base | Representation |
---|---|
bin | 11101011001110111111… |
… | …01100100110110001101 |
3 | 10120120211011120000022102 |
4 | 32230323331210312031 |
5 | 113023120231441023 |
6 | 2052045222524445 |
7 | 132664516312421 |
oct | 16547375446615 |
9 | 3516734500272 |
10 | 1010323312013 |
11 | 35a526197014 |
12 | 143983296725 |
13 | 74371c568a2 |
14 | 36c854cab81 |
15 | 1b432bda628 |
hex | eb3bf64d8d |
1010323312013 has 8 divisors (see below), whose sum is σ = 1059882641280. Its totient is φ = 961745355760.
The previous prime is 1010323311997. The next prime is 1010323312039. The reversal of 1010323312013 is 3102133230101.
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 1010323312013 - 24 = 1010323311997 is a prime.
It is a super-2 number, since 2×10103233120132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010323312913) 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, 245341145 + ... + 245345262.
It is an arithmetic number, because the mean of its divisors is an integer number (132485330160).
Almost surely, 21010323312013 is an apocalyptic number.
It is an amenable number.
1010323312013 is a deficient number, since it is larger than the sum of its proper divisors (49559329267).
1010323312013 is an equidigital number, since it uses as much as digits as its factorization.
1010323312013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 490686507.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1010323312013 its reverse (3102133230101), we get a palindrome (4112456542114).
The spelling of 1010323312013 in words is "one trillion, ten billion, three hundred twenty-three million, three hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •