Base | Representation |
---|---|
bin | 1001001111101100000000… |
… | …01000110111100000001111 |
3 | 2122222112212200111200001100 |
4 | 10213312000020313200033 |
5 | 10131042302341120421 |
6 | 111123325001314143 |
7 | 4165545023621544 |
oct | 447660010674017 |
9 | 78875780450040 |
10 | 20330230020111 |
11 | 6529002924930 |
12 | 2344174a95953 |
13 | b46195042bbb |
14 | 503dba1a2bcb |
15 | 253c81457c26 |
hex | 127d8023780f |
20330230020111 has 24 divisors (see below), whose sum is σ = 32036489044560. Its totient is φ = 12320976499200.
The previous prime is 20330230020091. The next prime is 20330230020157. The reversal of 20330230020111 is 11102003203302.
20330230020111 is a `hidden beast` number, since 2 + 0 + 330 + 2 + 300 + 20 + 1 + 11 = 666.
It is not a de Polignac number, because 20330230020111 - 26 = 20330230020047 is a prime.
It is a super-2 number, since 2×203302300201112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20330230020311) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 161151 + ... + 6378591.
It is an arithmetic number, because the mean of its divisors is an integer number (1334853710190).
Almost surely, 220330230020111 is an apocalyptic number.
20330230020111 is a deficient number, since it is larger than the sum of its proper divisors (11706259024449).
20330230020111 is a wasteful number, since it uses less digits than its factorization.
20330230020111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6250487 (or 6250484 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 20330230020111 its reverse (11102003203302), we get a palindrome (31432233223413).
The spelling of 20330230020111 in words is "twenty trillion, three hundred thirty billion, two hundred thirty million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •