Base | Representation |
---|---|
bin | 11101010010110001010… |
… | …110010111000010111001 |
3 | 21010102221211111122102202 |
4 | 131102301112113002321 |
5 | 230440131122421241 |
6 | 4140434011235545 |
7 | 265302341504204 |
oct | 35226126270271 |
9 | 7112854448382 |
10 | 2013020123321 |
11 | 706798420189 |
12 | 286178448bb5 |
13 | 117a99b6065c |
14 | 6d605b7693b |
15 | 3756b0a6d9b |
hex | 1d4b15970b9 |
2013020123321 has 4 divisors (see below), whose sum is σ = 2013877824912. Its totient is φ = 2012162421732.
The previous prime is 2013020123299. The next prime is 2013020123329. The reversal of 2013020123321 is 1233210203102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2013020123321 - 234 = 1995840254137 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2013020123293 and 2013020123302.
It is not an unprimeable number, because it can be changed into a prime (2013020123329) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 428847275 + ... + 428851968.
It is an arithmetic number, because the mean of its divisors is an integer number (503469456228).
Almost surely, 22013020123321 is an apocalyptic number.
It is an amenable number.
2013020123321 is a deficient number, since it is larger than the sum of its proper divisors (857701591).
2013020123321 is an equidigital number, since it uses as much as digits as its factorization.
2013020123321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 857701590.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2013020123321 its reverse (1233210203102), we get a palindrome (3246230326423).
The spelling of 2013020123321 in words is "two trillion, thirteen billion, twenty million, one hundred twenty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •