Base | Representation |
---|---|
bin | 11101100010101011111… |
… | …111100100101101101100 |
3 | 21012002001212101002112220 |
4 | 131202223333210231230 |
5 | 231230131143224400 |
6 | 4152341505355340 |
7 | 266446010261460 |
oct | 35425377445554 |
9 | 7162055332486 |
10 | 2030110133100 |
11 | 712a68277505 |
12 | 289547938b50 |
13 | 1195916aa28a |
14 | 703877a64a0 |
15 | 37c1b60d7a0 |
hex | 1d8abfe4b6c |
2030110133100 has 72 divisors (see below), whose sum is σ = 6712897513728. Its totient is φ = 464025172800.
The previous prime is 2030110133081. The next prime is 2030110133111. The reversal of 2030110133100 is 13310110302.
It is a super-2 number, since 2×20301101331002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2030110133100.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 483357456 + ... + 483361655.
Almost surely, 22030110133100 is an apocalyptic number.
2030110133100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2030110133100 is an abundant number, since it is smaller than the sum of its proper divisors (4682787380628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2030110133100 is a wasteful number, since it uses less digits than its factorization.
2030110133100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 966719135 (or 966719128 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 2030110133100 its reverse (13310110302), we get a palindrome (2043420243402).
The spelling of 2030110133100 in words is "two trillion, thirty billion, one hundred ten million, one hundred thirty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •