Base | Representation |
---|---|
bin | 110100110000110010100100… |
… | …100001010011101100101111 |
3 | 1010102121212211211020012111012 |
4 | 310300302210201103230233 |
5 | 220403411431313410101 |
6 | 2141310512445015435 |
7 | 66610102244041220 |
oct | 6460624441235457 |
9 | 1112555754205435 |
10 | 232051253263151 |
11 | 67a364249a3403 |
12 | 2203910725457b |
13 | 9c6345455512a |
14 | 41434aa7c7247 |
15 | 1bc62bb747bbb |
hex | d30ca4853b2f |
232051253263151 has 16 divisors (see below), whose sum is σ = 270302047170048. Its totient is φ = 195078302359200.
The previous prime is 232051253263111. The next prime is 232051253263229. The reversal of 232051253263151 is 151362352150232.
It is a cyclic number.
It is not a de Polignac number, because 232051253263151 - 242 = 227653206752047 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 232051253263099 and 232051253263108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232051253263111) 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 15 ways as a sum of consecutive naturals, for example, 111016685 + ... + 113087606.
It is an arithmetic number, because the mean of its divisors is an integer number (16893877948128).
Almost surely, 2232051253263151 is an apocalyptic number.
232051253263151 is a deficient number, since it is larger than the sum of its proper divisors (38250793906897).
232051253263151 is a wasteful number, since it uses less digits than its factorization.
232051253263151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224107142.
The product of its (nonzero) digits is 324000, while the sum is 41.
The spelling of 232051253263151 in words is "two hundred thirty-two trillion, fifty-one billion, two hundred fifty-three million, two hundred sixty-three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •