Base | Representation |
---|---|
bin | 110100110100011011001100… |
… | …100011111011010011000111 |
3 | 1010110111202120102010201101202 |
4 | 310310123030203323103013 |
5 | 220422010003441011242 |
6 | 2142021342114413115 |
7 | 66634124105006564 |
oct | 6464331443732307 |
9 | 1113452512121352 |
10 | 232301033141447 |
11 | 68022351150996 |
12 | 220795b5b9119b |
13 | 9c80b7cb3309a |
14 | 4151603c9986b |
15 | 1bcca3a080932 |
hex | d346cc8fb4c7 |
232301033141447 has 2 divisors, whose sum is σ = 232301033141448. Its totient is φ = 232301033141446.
The previous prime is 232301033141351. The next prime is 232301033141449. The reversal of 232301033141447 is 744141330103232.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-232301033141447 is a prime.
Together with 232301033141449, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 232301033141447.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232301033141449) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116150516570723 + 116150516570724.
It is an arithmetic number, because the mean of its divisors is an integer number (116150516570724).
Almost surely, 2232301033141447 is an apocalyptic number.
232301033141447 is a deficient number, since it is larger than the sum of its proper divisors (1).
232301033141447 is an equidigital number, since it uses as much as digits as its factorization.
232301033141447 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 145152, while the sum is 38.
Adding to 232301033141447 its reverse (744141330103232), we get a palindrome (976442363244679).
The spelling of 232301033141447 in words is "two hundred thirty-two trillion, three hundred one billion, thirty-three million, one hundred forty-one thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •