Base | Representation |
---|---|
bin | 1001001001110111001110… |
… | …11101100010101101110001 |
3 | 2122021102022021121211002021 |
4 | 10210323213131202231301 |
5 | 10114302421101432241 |
6 | 110451350145151441 |
7 | 4145231434025551 |
oct | 444734735425561 |
9 | 78242267554067 |
10 | 20130100030321 |
11 | 6461144749456 |
12 | 231142192b581 |
13 | b3034cb0cab8 |
14 | 4d8432b25161 |
15 | 24d96b8a80d1 |
hex | 124ee7762b71 |
20130100030321 has 8 divisors (see below), whose sum is σ = 20143411928640. Its totient is φ = 20116788647568.
The previous prime is 20130100030309. The next prime is 20130100030351. The reversal of 20130100030321 is 12303000103102.
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 20130100030321 - 223 = 20130091641713 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20130100030295 and 20130100030304.
It is not an unprimeable number, because it can be changed into a prime (20130100030351) 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, 107394735 + ... + 107582011.
It is an arithmetic number, because the mean of its divisors is an integer number (2517926491080).
Almost surely, 220130100030321 is an apocalyptic number.
It is an amenable number.
20130100030321 is a deficient number, since it is larger than the sum of its proper divisors (13311898319).
20130100030321 is a wasteful number, since it uses less digits than its factorization.
20130100030321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257783.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 20130100030321 its reverse (12303000103102), we get a palindrome (32433100133423).
The spelling of 20130100030321 in words is "twenty trillion, one hundred thirty billion, one hundred million, thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •