Base | Representation |
---|---|
bin | 110100110100011011011000… |
… | …010111111000010111010101 |
3 | 1010110111210002020000201221122 |
4 | 310310123120113320113111 |
5 | 220422010410203412133 |
6 | 2142021413514053325 |
7 | 66634132032266405 |
oct | 6464333027702725 |
9 | 1113453066021848 |
10 | 232301231310293 |
11 | 68022442aa30a2 |
12 | 2207965041a245 |
13 | 9c80bb1bc8a62 |
14 | 4151622322805 |
15 | 1bcca4c677498 |
hex | d346d85f85d5 |
232301231310293 has 2 divisors, whose sum is σ = 232301231310294. Its totient is φ = 232301231310292.
The previous prime is 232301231310289. The next prime is 232301231310329. The reversal of 232301231310293 is 392013132103232.
Together with next prime (232301231310329) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 230600716204849 + 1700515105444 = 15185543^2 + 1304038^2 .
It is a cyclic number.
It is not a de Polignac number, because 232301231310293 - 22 = 232301231310289 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232301231310193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116150615655146 + 116150615655147.
It is an arithmetic number, because the mean of its divisors is an integer number (116150615655147).
Almost surely, 2232301231310293 is an apocalyptic number.
It is an amenable number.
232301231310293 is a deficient number, since it is larger than the sum of its proper divisors (1).
232301231310293 is an equidigital number, since it uses as much as digits as its factorization.
232301231310293 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34992, while the sum is 35.
The spelling of 232301231310293 in words is "two hundred thirty-two trillion, three hundred one billion, two hundred thirty-one million, three hundred ten thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •