Base | Representation |
---|---|
bin | 1010011100101010100001… |
… | …01001101000100111100001 |
3 | 10000100101211112101022112102 |
4 | 11032111100221220213201 |
5 | 11002411033042022412 |
6 | 120510344102540145 |
7 | 4560620134426646 |
oct | 516252051504741 |
9 | 100311745338472 |
10 | 22975133157857 |
11 | 7358776786201 |
12 | 26b0899737655 |
13 | ca871306035a |
14 | 59600674ddcd |
15 | 29c98145b8c2 |
hex | 14e550a689e1 |
22975133157857 has 2 divisors, whose sum is σ = 22975133157858. Its totient is φ = 22975133157856.
The previous prime is 22975133157787. The next prime is 22975133157947. The reversal of 22975133157857 is 75875133157922.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19886569438096 + 3088563719761 = 4459436^2 + 1757431^2 .
It is a cyclic number.
It is not a de Polignac number, because 22975133157857 - 238 = 22700255250913 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22975133157793 and 22975133157802.
It is not a weakly prime, because it can be changed into another prime (22975133157257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11487566578928 + 11487566578929.
It is an arithmetic number, because the mean of its divisors is an integer number (11487566578929).
Almost surely, 222975133157857 is an apocalyptic number.
It is an amenable number.
22975133157857 is a deficient number, since it is larger than the sum of its proper divisors (1).
22975133157857 is an equidigital number, since it uses as much as digits as its factorization.
22975133157857 is an evil number, because the sum of its binary digits is even.
The product of its digits is 111132000, while the sum is 65.
Adding to 22975133157857 its sum of digits (65), we get a palindrome (22975133157922).
The spelling of 22975133157857 in words is "twenty-two trillion, nine hundred seventy-five billion, one hundred thirty-three million, one hundred fifty-seven thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •