Base | Representation |
---|---|
bin | 110100110000011000100010… |
… | …100111011110111001001001 |
3 | 1010102112012200222211120002112 |
4 | 310300120202213132321021 |
5 | 220402432211313240014 |
6 | 2141250011232112105 |
7 | 66605062525415516 |
oct | 6460304247367111 |
9 | 1112465628746075 |
10 | 232023304040009 |
11 | 67a25592328389 |
12 | 22033807095635 |
13 | 9c6091c005281 |
14 | 4141db889430d |
15 | 1bc56d2bb173e |
hex | d306229dee49 |
232023304040009 has 4 divisors (see below), whose sum is σ = 244235056884240. Its totient is φ = 219811551195780.
The previous prime is 232023304039889. The next prime is 232023304040027. The reversal of 232023304040009 is 900040403320232.
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 232023304040009 - 228 = 232023035604553 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (232023304040509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6105876422087 + ... + 6105876422124.
It is an arithmetic number, because the mean of its divisors is an integer number (61058764221060).
Almost surely, 2232023304040009 is an apocalyptic number.
It is an amenable number.
232023304040009 is a deficient number, since it is larger than the sum of its proper divisors (12211752844231).
232023304040009 is a wasteful number, since it uses less digits than its factorization.
232023304040009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12211752844230.
The product of its (nonzero) digits is 31104, while the sum is 32.
The spelling of 232023304040009 in words is "two hundred thirty-two trillion, twenty-three billion, three hundred four million, forty thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •