Base | Representation |
---|---|
bin | 1010011110010100011100… |
… | …10000000010101001111001 |
3 | 10000112211121202122201212221 |
4 | 11033022032100002221321 |
5 | 11004324014302223001 |
6 | 120552431050404041 |
7 | 4565002314052156 |
oct | 517121620025171 |
9 | 100484552581787 |
10 | 23032001211001 |
11 | 737a8a9271232 |
12 | 26bb90a730621 |
13 | cb0ba6988343 |
14 | 598a7d29122d |
15 | 29e1adc551a1 |
hex | 14f28e402a79 |
23032001211001 has 4 divisors (see below), whose sum is σ = 23113965628404. Its totient is φ = 22950036793600.
The previous prime is 23032001210993. The next prime is 23032001211041. The reversal of 23032001211001 is 10011210023032.
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 8841410849401 + 14190590361600 = 2973451^2 + 3767040^2 .
It is a cyclic number.
It is not a de Polignac number, because 23032001211001 - 23 = 23032001210993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23032001211041) 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, 40982208280 + ... + 40982208841.
It is an arithmetic number, because the mean of its divisors is an integer number (5778491407101).
Almost surely, 223032001211001 is an apocalyptic number.
It is an amenable number.
23032001211001 is a deficient number, since it is larger than the sum of its proper divisors (81964417403).
23032001211001 is an equidigital number, since it uses as much as digits as its factorization.
23032001211001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81964417402.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 23032001211001 its reverse (10011210023032), we get a palindrome (33043211234033).
The spelling of 23032001211001 in words is "twenty-three trillion, thirty-two billion, one million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •