Base | Representation |
---|---|
bin | 11101011001111010001… |
… | …00111111001010001101 |
3 | 10120120212110210002022202 |
4 | 32230331010333022031 |
5 | 113023140030011023 |
6 | 2052051132051245 |
7 | 132665134400606 |
oct | 16547504771215 |
9 | 3516773702282 |
10 | 1010342032013 |
11 | 35a535812696 |
12 | 143989603b25 |
13 | 74375aac502 |
14 | 36c87ba0dad |
15 | 1b434687128 |
hex | eb3d13f28d |
1010342032013 has 8 divisors (see below), whose sum is σ = 1031993898240. Its totient is φ = 988696633680.
The previous prime is 1010342032009. The next prime is 1010342032033. The reversal of 1010342032013 is 3102302430101.
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 1010342032013 - 22 = 1010342032009 is a prime.
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 (1010342032033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1300553 + ... + 1926686.
It is an arithmetic number, because the mean of its divisors is an integer number (128999237280).
Almost surely, 21010342032013 is an apocalyptic number.
It is an amenable number.
1010342032013 is a deficient number, since it is larger than the sum of its proper divisors (21651866227).
1010342032013 is an equidigital number, since it uses as much as digits as its factorization.
1010342032013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3233947.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1010342032013 its reverse (3102302430101), we get a palindrome (4112644462114).
The spelling of 1010342032013 in words is "one trillion, ten billion, three hundred forty-two million, thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •