Base | Representation |
---|---|
bin | 101011110111001000001… |
… | …010001110110111000001 |
3 | 101200010222220201210211220 |
4 | 223313020022032313001 |
5 | 343340414312400001 |
6 | 10224401114425253 |
7 | 430522645655334 |
oct | 53671012166701 |
9 | 11603886653756 |
10 | 3014130200001 |
11 | a62315a13118 |
12 | 4081aa132229 |
13 | 18b3010c75ab |
14 | a5c557c261b |
15 | 5360eee4c36 |
hex | 2bdc828edc1 |
3014130200001 has 8 divisors (see below), whose sum is σ = 4230358175520. Its totient is φ = 1903661178912.
The previous prime is 3014130199991. The next prime is 3014130200047. The reversal of 3014130200001 is 1000020314103.
3014130200001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3014130200001 - 26 = 3014130199937 is a prime.
It is a super-3 number, since 3×30141302000013 (a number of 38 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (3014130200051) 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, 26439738540 + ... + 26439738653.
It is an arithmetic number, because the mean of its divisors is an integer number (528794771940).
Almost surely, 23014130200001 is an apocalyptic number.
It is an amenable number.
3014130200001 is a deficient number, since it is larger than the sum of its proper divisors (1216227975519).
3014130200001 is a wasteful number, since it uses less digits than its factorization.
3014130200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52879477215.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 3014130200001 its reverse (1000020314103), we get a palindrome (4014150514104).
The spelling of 3014130200001 in words is "three trillion, fourteen billion, one hundred thirty million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •