Base | Representation |
---|---|
bin | 1010100100000110000110… |
… | …10101100111011110111001 |
3 | 10001020210212201120010001012 |
4 | 11102003003111213132321 |
5 | 11021101440323020013 |
6 | 121223532015003305 |
7 | 4615226315022101 |
oct | 522030325473671 |
9 | 101223781503035 |
10 | 23230460360633 |
11 | 7446a8a290779 |
12 | 2732276209535 |
13 | cc68139b1626 |
14 | 5a4508878201 |
15 | 2a4426cb11a8 |
hex | 1520c35677b9 |
23230460360633 has 2 divisors, whose sum is σ = 23230460360634. Its totient is φ = 23230460360632.
The previous prime is 23230460360599. The next prime is 23230460360659. The reversal of 23230460360633 is 33606306403232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13761072806464 + 9469387554169 = 3709592^2 + 3077237^2 .
It is a cyclic number.
It is not a de Polignac number, because 23230460360633 - 210 = 23230460359609 is a prime.
It is not a weakly prime, because it can be changed into another prime (23230460360533) 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 as a sum of consecutive naturals, namely, 11615230180316 + 11615230180317.
It is an arithmetic number, because the mean of its divisors is an integer number (11615230180317).
Almost surely, 223230460360633 is an apocalyptic number.
It is an amenable number.
23230460360633 is a deficient number, since it is larger than the sum of its proper divisors (1).
23230460360633 is an equidigital number, since it uses as much as digits as its factorization.
23230460360633 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 839808, while the sum is 41.
Adding to 23230460360633 its reverse (33606306403232), we get a palindrome (56836766763865).
The spelling of 23230460360633 in words is "twenty-three trillion, two hundred thirty billion, four hundred sixty million, three hundred sixty thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •