Base | Representation |
---|---|
bin | 1101100000010110100… |
… | …1100010111110000111 |
3 | 211011220002020012112112 |
4 | 3120011221202332013 |
5 | 12300140342324312 |
6 | 254331230211235 |
7 | 22522514024501 |
oct | 3300551427607 |
9 | 734802205475 |
10 | 232023011207 |
11 | 8a444a39519 |
12 | 38b74053b1b |
13 | 18b58857510 |
14 | b331094d71 |
15 | 607e9a8d22 |
hex | 3605a62f87 |
232023011207 has 16 divisors (see below), whose sum is σ = 260758310400. Its totient is φ = 204844724832.
The previous prime is 232023011173. The next prime is 232023011219. The reversal of 232023011207 is 702110320232.
232023011207 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 232023011207 - 28 = 232023010951 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232023011257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4130294 + ... + 4186092.
It is an arithmetic number, because the mean of its divisors is an integer number (16297394400).
Almost surely, 2232023011207 is an apocalyptic number.
232023011207 is a deficient number, since it is larger than the sum of its proper divisors (28735299193).
232023011207 is a wasteful number, since it uses less digits than its factorization.
232023011207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69742.
The product of its (nonzero) digits is 1008, while the sum is 23.
Adding to 232023011207 its reverse (702110320232), we get a palindrome (934133331439).
The spelling of 232023011207 in words is "two hundred thirty-two billion, twenty-three million, eleven thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •