Base | Representation |
---|---|
bin | 11101100010101100101… |
… | …001000100011101000101 |
3 | 21012002002121211202020120 |
4 | 131202230221010131011 |
5 | 231230141434323023 |
6 | 4152342534452153 |
7 | 266446201605504 |
oct | 35425451043505 |
9 | 7162077752216 |
10 | 2030121011013 |
11 | 712a73427217 |
12 | 28954b504059 |
13 | 119593a18604 |
14 | 70388dd883b |
15 | 37c1c55b8e3 |
hex | 1d8aca44745 |
2030121011013 has 8 divisors (see below), whose sum is σ = 2711568521376. Its totient is φ = 1351043754000.
The previous prime is 2030121010993. The next prime is 2030121011029. The reversal of 2030121011013 is 3101101210302.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-2030121011013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2030121010983 and 2030121011001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2030121511013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 592561338 + ... + 592564763.
It is an arithmetic number, because the mean of its divisors is an integer number (338946065172).
Almost surely, 22030121011013 is an apocalyptic number.
It is an amenable number.
2030121011013 is a deficient number, since it is larger than the sum of its proper divisors (681447510363).
2030121011013 is a wasteful number, since it uses less digits than its factorization.
2030121011013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1185126675.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 2030121011013 its reverse (3101101210302), we get a palindrome (5131222221315).
The spelling of 2030121011013 in words is "two trillion, thirty billion, one hundred twenty-one million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •