Base | Representation |
---|---|
bin | 1101101111100001010111… |
… | …00001100000110010100001 |
3 | 10222000000102010111102110110 |
4 | 12313300223201200302201 |
5 | 12430111301221200001 |
6 | 144134533112521533 |
7 | 6236221514355666 |
oct | 667605341406241 |
9 | 128000363442413 |
10 | 30220120100001 |
11 | 96a130aa61177 |
12 | 3480a410b02a9 |
13 | 13b298bc96630 |
14 | 766939697a6d |
15 | 3761647de3d6 |
hex | 1b7c2b860ca1 |
30220120100001 has 32 divisors (see below), whose sum is σ = 45236259855360. Its totient is φ = 17818904736000.
The previous prime is 30220120099987. The next prime is 30220120100021. The reversal of 30220120100001 is 10000102102203.
It is not a de Polignac number, because 30220120100001 - 210 = 30220120098977 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30220120100001.
It is not an unprimeable number, because it can be changed into a prime (30220120100021) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 123620286 + ... + 123864503.
It is an arithmetic number, because the mean of its divisors is an integer number (1413633120480).
Almost surely, 230220120100001 is an apocalyptic number.
30220120100001 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
30220120100001 is a deficient number, since it is larger than the sum of its proper divisors (15016139755359).
30220120100001 is a wasteful number, since it uses less digits than its factorization.
30220120100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247484937.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 30220120100001 its reverse (10000102102203), we get a palindrome (40220222202204).
The spelling of 30220120100001 in words is "thirty trillion, two hundred twenty billion, one hundred twenty million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •