Base | Representation |
---|---|
bin | 10101011101100011… |
… | …000110101111001001 |
3 | 2012110222221202110210 |
4 | 111131203012233021 |
5 | 334143321221301 |
6 | 14330355431333 |
7 | 1444026330000 |
oct | 253543065711 |
9 | 65428852423 |
10 | 23044320201 |
11 | 9855a10931 |
12 | 45715b5549 |
13 | 2233309236 |
14 | 1188747c37 |
15 | 8ed166ad6 |
hex | 55d8c6bc9 |
23044320201 has 80 divisors (see below), whose sum is σ = 36760772160. Its totient is φ = 12835992960.
The previous prime is 23044320191. The next prime is 23044320223. The reversal of 23044320201 is 10202344032.
It is not a de Polignac number, because 23044320201 - 211 = 23044318153 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23044320001) by changing a digit.
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 79 ways as a sum of consecutive naturals, for example, 78649411 + ... + 78649703.
It is an arithmetic number, because the mean of its divisors is an integer number (459509652).
Almost surely, 223044320201 is an apocalyptic number.
23044320201 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
23044320201 is a deficient number, since it is larger than the sum of its proper divisors (13716451959).
23044320201 is an equidigital number, since it uses as much as digits as its factorization.
23044320201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 564 (or 543 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 23044320201 its reverse (10202344032), we get a palindrome (33246664233).
The spelling of 23044320201 in words is "twenty-three billion, forty-four million, three hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •