Base | Representation |
---|---|
bin | 11101100010101100000… |
… | …010111010110011011100 |
3 | 21012002001221000122110010 |
4 | 131202230002322303130 |
5 | 231230131404310022 |
6 | 4152341540243220 |
7 | 266446020603201 |
oct | 35425402726334 |
9 | 7162057018403 |
10 | 2030111010012 |
11 | 712a68816328 |
12 | 2895480a0510 |
13 | 119591926467 |
14 | 70387953ca8 |
15 | 37c1b73350c |
hex | 1d8ac0bacdc |
2030111010012 has 12 divisors (see below), whose sum is σ = 4736925690056. Its totient is φ = 676703670000.
The previous prime is 2030111009987. The next prime is 2030111010077. The reversal of 2030111010012 is 2100101110302.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 169175917501 = 2030111010012 / (2 + 0 + 3 + 0 + 1 + 1 + 1 + 0 + 1 + 0 + 0 + 1 + 2).
It is a self number, because there is not a number n which added to its sum of digits gives 2030111010012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 84587958739 + ... + 84587958762.
Almost surely, 22030111010012 is an apocalyptic number.
It is an amenable number.
2030111010012 is an abundant number, since it is smaller than the sum of its proper divisors (2706814680044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2030111010012 is a wasteful number, since it uses less digits than its factorization.
2030111010012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169175917508 (or 169175917506 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 2030111010012 its reverse (2100101110302), we get a palindrome (4130212120314).
The spelling of 2030111010012 in words is "two trillion, thirty billion, one hundred eleven million, ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •