Base | Representation |
---|---|
bin | 10010110101110100… |
… | …000101101100111000 |
3 | 1221012212200122110010 |
4 | 102311310011230320 |
5 | 312412412400440 |
6 | 13143231221520 |
7 | 1314215602164 |
oct | 226564055470 |
9 | 57185618403 |
10 | 20230200120 |
11 | 8641469859 |
12 | 3b070778a0 |
13 | 1ba52a7020 |
14 | d9cac9ca4 |
15 | 7d608d580 |
hex | 4b5d05b38 |
20230200120 has 64 divisors (see below), whose sum is σ = 65359113120. Its totient is φ = 4979741184.
The previous prime is 20230200101. The next prime is 20230200121. The reversal of 20230200120 is 2100203202.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 20230200096 and 20230200105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20230200121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6482479 + ... + 6485598.
Almost surely, 220230200120 is an apocalyptic number.
20230200120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20230200120 is an abundant number, since it is smaller than the sum of its proper divisors (45128913000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20230200120 is a wasteful number, since it uses less digits than its factorization.
20230200120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12968104 (or 12968100 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
Adding to 20230200120 its reverse (2100203202), we get a palindrome (22330403322).
The spelling of 20230200120 in words is "twenty billion, two hundred thirty million, two hundred thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •