Base | Representation |
---|---|
bin | 10101100110111001… |
… | …100100001110110001 |
3 | 2012212221011020101022 |
4 | 111212321210032301 |
5 | 340004001444441 |
6 | 14354122145225 |
7 | 1450642654415 |
oct | 254671441661 |
9 | 65787136338 |
10 | 23201203121 |
11 | 9926524338 |
12 | 45b6052215 |
13 | 2259977c75 |
14 | 11a1504d45 |
15 | 90bd0584b |
hex | 566e643b1 |
23201203121 has 4 divisors (see below), whose sum is σ = 23203723044. Its totient is φ = 23198683200.
The previous prime is 23201203099. The next prime is 23201203127. The reversal of 23201203121 is 12130210232.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 14840112400 + 8361090721 = 121820^2 + 91439^2 .
It is a cyclic number.
It is not a de Polignac number, because 23201203121 - 230 = 22127461297 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 23201203121.
It is not an unprimeable number, because it can be changed into a prime (23201203127) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1246100 + ... + 1264581.
It is an arithmetic number, because the mean of its divisors is an integer number (5800930761).
Almost surely, 223201203121 is an apocalyptic number.
It is an amenable number.
23201203121 is a deficient number, since it is larger than the sum of its proper divisors (2519923).
23201203121 is an equidigital number, since it uses as much as digits as its factorization.
23201203121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2519922.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 23201203121 its reverse (12130210232), we get a palindrome (35331413353).
The spelling of 23201203121 in words is "twenty-three billion, two hundred one million, two hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •