Base | Representation |
---|---|
bin | 1010011110000000011000… |
… | …10110111000101000101101 |
3 | 10000111210211020112202221120 |
4 | 11033000030112320220231 |
5 | 11004134440400013201 |
6 | 120543450305451153 |
7 | 4564141406412546 |
oct | 517001426705055 |
9 | 100453736482846 |
10 | 23021232032301 |
11 | 7376282357948 |
12 | 26b9804040ab9 |
13 | cacb7b819a59 |
14 | 59833ad074cd |
15 | 29dc7d5ac536 |
hex | 14f00c5b8a2d |
23021232032301 has 4 divisors (see below), whose sum is σ = 30694976043072. Its totient is φ = 15347488021532.
The previous prime is 23021232032273. The next prime is 23021232032327. The reversal of 23021232032301 is 10323023212032.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 23021232032301 - 26 = 23021232032237 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23021232032801) 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, 3836872005381 + ... + 3836872005386.
It is an arithmetic number, because the mean of its divisors is an integer number (7673744010768).
Almost surely, 223021232032301 is an apocalyptic number.
It is an amenable number.
23021232032301 is a deficient number, since it is larger than the sum of its proper divisors (7673744010771).
23021232032301 is an equidigital number, since it uses as much as digits as its factorization.
23021232032301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7673744010770.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 23021232032301 its reverse (10323023212032), we get a palindrome (33344255244333).
The spelling of 23021232032301 in words is "twenty-three trillion, twenty-one billion, two hundred thirty-two million, thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •