Base | Representation |
---|---|
bin | 11101010010110110001… |
… | …110110001011011100011 |
3 | 21010110011112121110000001 |
4 | 131102312032301123203 |
5 | 230440313104122243 |
6 | 4140450054440431 |
7 | 265304354561032 |
oct | 35226616613343 |
9 | 7113145543001 |
10 | 2013102020323 |
11 | 70682a677659 |
12 | 28619b963117 |
13 | 117ab0b06314 |
14 | 6d6129b4719 |
15 | 37573382a4d |
hex | 1d4b63b16e3 |
2013102020323 has 4 divisors (see below), whose sum is σ = 2013445032160. Its totient is φ = 2012759008488.
The previous prime is 2013102020227. The next prime is 2013102020333. The reversal of 2013102020323 is 3230202013102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2013102020323 - 29 = 2013102019811 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2013102020323.
It is not an unprimeable number, because it can be changed into a prime (2013102020333) 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 3 ways as a sum of consecutive naturals, for example, 171497115 + ... + 171508852.
It is an arithmetic number, because the mean of its divisors is an integer number (503361258040).
Almost surely, 22013102020323 is an apocalyptic number.
2013102020323 is a deficient number, since it is larger than the sum of its proper divisors (343011837).
2013102020323 is an equidigital number, since it uses as much as digits as its factorization.
2013102020323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343011836.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 2013102020323 its reverse (3230202013102), we get a palindrome (5243304033425).
The spelling of 2013102020323 in words is "two trillion, thirteen billion, one hundred two million, twenty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •