Base | Representation |
---|---|
bin | 1001010011011110111110… |
… | …0100111001011010010001 |
3 | 1100020000021202002210111022 |
4 | 2110313233210321122101 |
5 | 2320103212124334422 |
6 | 33431430212525225 |
7 | 2104055163653051 |
oct | 224675744713221 |
9 | 40200252083438 |
10 | 10230336558737 |
11 | 3294730312869 |
12 | 119285b020815 |
13 | 59294149a969 |
14 | 275218227561 |
15 | 12b1ab822342 |
hex | 94def939691 |
10230336558737 has 2 divisors, whose sum is σ = 10230336558738. Its totient is φ = 10230336558736.
The previous prime is 10230336558721. The next prime is 10230336558763. The reversal of 10230336558737 is 73785563303201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9806693086096 + 423643472641 = 3131564^2 + 650879^2 .
It is an emirp because it is prime and its reverse (73785563303201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10230336558737 - 24 = 10230336558721 is a prime.
It is a super-2 number, since 2×102303365587372 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10230336518737) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5115168279368 + 5115168279369.
It is an arithmetic number, because the mean of its divisors is an integer number (5115168279369).
Almost surely, 210230336558737 is an apocalyptic number.
It is an amenable number.
10230336558737 is a deficient number, since it is larger than the sum of its proper divisors (1).
10230336558737 is an equidigital number, since it uses as much as digits as its factorization.
10230336558737 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9525600, while the sum is 53.
The spelling of 10230336558737 in words is "ten trillion, two hundred thirty billion, three hundred thirty-six million, five hundred fifty-eight thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •