Base | Representation |
---|---|
bin | 10101101110000110… |
… | …010111111011100000 |
3 | 2020012100110102002021 |
4 | 111232012113323200 |
5 | 340230413013440 |
6 | 14414115231224 |
7 | 1453640511235 |
oct | 255606277340 |
9 | 66170412067 |
10 | 23322001120 |
11 | 99887306a0 |
12 | 462a5a8514 |
13 | 22789c1182 |
14 | 11b358b78c |
15 | 91771784a |
hex | 56e197ee0 |
23322001120 has 48 divisors (see below), whose sum is σ = 60107161968. Its totient is φ = 8480727040.
The previous prime is 23322001099. The next prime is 23322001169. The reversal of 23322001120 is 2110022332.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 23322001094 and 23322001103.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6623809 + ... + 6627328.
It is an arithmetic number, because the mean of its divisors is an integer number (1252232541).
Almost surely, 223322001120 is an apocalyptic number.
23322001120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23322001120 is an abundant number, since it is smaller than the sum of its proper divisors (36785160848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23322001120 is a wasteful number, since it uses less digits than its factorization.
23322001120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13251163 (or 13251155 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 23322001120 its reverse (2110022332), we get a palindrome (25432023452).
The spelling of 23322001120 in words is "twenty-three billion, three hundred twenty-two million, one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •