Base | Representation |
---|---|
bin | 1010100111101101001001… |
… | …01011011111010110000001 |
3 | 10001200200001021010022210111 |
4 | 11103312210223133112001 |
5 | 11030120004003133403 |
6 | 121400524220031321 |
7 | 4630210166013301 |
oct | 523664453372601 |
9 | 101620037108714 |
10 | 23354500052353 |
11 | 7494651479a98 |
12 | 2752312992541 |
13 | 1005420aa6812 |
14 | 5aa514507601 |
15 | 2a778672c56d |
hex | 153da4adf581 |
23354500052353 has 4 divisors (see below), whose sum is σ = 23360641129008. Its totient is φ = 23348358975700.
The previous prime is 23354500052321. The next prime is 23354500052407. The reversal of 23354500052353 is 35325000545332.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 23354500052353 - 25 = 23354500052321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23354500052753) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3070532623 + ... + 3070540228.
It is an arithmetic number, because the mean of its divisors is an integer number (5840160282252).
Almost surely, 223354500052353 is an apocalyptic number.
It is an amenable number.
23354500052353 is a deficient number, since it is larger than the sum of its proper divisors (6141076655).
23354500052353 is an equidigital number, since it uses as much as digits as its factorization.
23354500052353 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6141076654.
The product of its (nonzero) digits is 810000, while the sum is 40.
Adding to 23354500052353 its reverse (35325000545332), we get a palindrome (58679500597685).
The spelling of 23354500052353 in words is "twenty-three trillion, three hundred fifty-four billion, five hundred million, fifty-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •