Base | Representation |
---|---|
bin | 1010100111000011101000… |
… | …10011000001111100110001 |
3 | 10001121112112002001001011111 |
4 | 11103201310103001330301 |
5 | 11024233333123411044 |
6 | 121342400525513321 |
7 | 4625461000304200 |
oct | 523416423017461 |
9 | 101545462031144 |
10 | 23332213497649 |
11 | 7486155282641 |
12 | 2749b33112841 |
13 | 10032ab783844 |
14 | 5a93dc693237 |
15 | 2a6dced98b34 |
hex | 1538744c1f31 |
23332213497649 has 27 divisors (see below), whose sum is σ = 27532046859321. Its totient is φ = 19715334775080.
The previous prime is 23332213497647. The next prime is 23332213497679. The reversal of 23332213497649 is 94679431223332.
The square root of 23332213497649 is 4830343.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 23332213497649 - 21 = 23332213497647 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23332213497593 and 23332213497602.
It is not an unprimeable number, because it can be changed into a prime (23332213497647) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 2400675612 + ... + 2400685330.
Almost surely, 223332213497649 is an apocalyptic number.
23332213497649 is the 4830343-rd square number.
23332213497649 is the 2415172-nd centered octagonal number.
It is an amenable number.
23332213497649 is a deficient number, since it is larger than the sum of its proper divisors (4199833361672).
23332213497649 is an frugal number, since it uses more digits than its factorization.
23332213497649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19594 (or 9797 counting only the distinct ones).
The product of its digits is 35271936, while the sum is 58.
The spelling of 23332213497649 in words is "twenty-three trillion, three hundred thirty-two billion, two hundred thirteen million, four hundred ninety-seven thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •