Base | Representation |
---|---|
bin | 110100110000011110111111… |
… | …100100010100011100111101 |
3 | 1010102112212120211101121022112 |
4 | 310300132333210110130331 |
5 | 220403040403420413041 |
6 | 2141253114522423405 |
7 | 66605426313001622 |
oct | 6460367744243475 |
9 | 1112485524347275 |
10 | 232030232201021 |
11 | 67a28518075291 |
12 | 2203501b361b65 |
13 | 9c61484477627 |
14 | 4142474a70349 |
15 | 1bc598b039deb |
hex | d307bf91473d |
232030232201021 has 8 divisors (see below), whose sum is σ = 235319316450624. Its totient is φ = 228741732751840.
The previous prime is 232030232201017. The next prime is 232030232201051. The reversal of 232030232201021 is 120102232030232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 232030232201021 - 22 = 232030232201017 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232030232201051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 145400915 + ... + 146988048.
It is an arithmetic number, because the mean of its divisors is an integer number (29414914556328).
Almost surely, 2232030232201021 is an apocalyptic number.
It is an amenable number.
232030232201021 is a deficient number, since it is larger than the sum of its proper divisors (3289084249603).
232030232201021 is a wasteful number, since it uses less digits than its factorization.
232030232201021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292400211.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 232030232201021 its reverse (120102232030232), we get a palindrome (352132464231253).
The spelling of 232030232201021 in words is "two hundred thirty-two trillion, thirty billion, two hundred thirty-two million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •