Base | Representation |
---|---|
bin | 110100111100011010111011… |
… | …111000011010100010000001 |
3 | 1010112110021212100010020000122 |
4 | 310330122323320122202001 |
5 | 221010010320313112343 |
6 | 2143122014103430025 |
7 | 100021615453501526 |
oct | 6474327370324201 |
9 | 1115407770106018 |
10 | 232850509113473 |
11 | 68214389aa3469 |
12 | 22147ba4455315 |
13 | 9cc092a2a4b44 |
14 | 417004bda114d |
15 | 1bdbe99546068 |
hex | d3c6bbe1a881 |
232850509113473 has 2 divisors, whose sum is σ = 232850509113474. Its totient is φ = 232850509113472.
The previous prime is 232850509113449. The next prime is 232850509113493. The reversal of 232850509113473 is 374311905058232.
232850509113473 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 207943552381504 + 24906956731969 = 14420248^2 + 4990687^2 .
It is a cyclic number.
It is not a de Polignac number, because 232850509113473 - 210 = 232850509112449 is a prime.
It is not a weakly prime, because it can be changed into another prime (232850509113413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116425254556736 + 116425254556737.
It is an arithmetic number, because the mean of its divisors is an integer number (116425254556737).
Almost surely, 2232850509113473 is an apocalyptic number.
It is an amenable number.
232850509113473 is a deficient number, since it is larger than the sum of its proper divisors (1).
232850509113473 is an equidigital number, since it uses as much as digits as its factorization.
232850509113473 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5443200, while the sum is 53.
The spelling of 232850509113473 in words is "two hundred thirty-two trillion, eight hundred fifty billion, five hundred nine million, one hundred thirteen thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •