Base | Representation |
---|---|
bin | 1010100110110000110101… |
… | …01011011001011001011001 |
3 | 10001120120110122100021220110 |
4 | 11103120122223121121121 |
5 | 11024102200210013423 |
6 | 121334011203114533 |
7 | 4624652606064453 |
oct | 523303253313131 |
9 | 101516418307813 |
10 | 23322120001113 |
11 | 748194580926a |
12 | 2747b96972a49 |
13 | 10023605bba9b |
14 | 5a8b21d532d3 |
15 | 2a69ddbbd193 |
hex | 15361aad9659 |
23322120001113 has 16 divisors (see below), whose sum is σ = 31695859996416. Its totient is φ = 15248470373760.
The previous prime is 23322120001099. The next prime is 23322120001177. The reversal of 23322120001113 is 31110002122332.
It is not a de Polignac number, because 23322120001113 - 29 = 23322120000601 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 23322120001113.
It is not an unprimeable number, because it can be changed into a prime (23322120001183) 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 in 15 ways as a sum of consecutive naturals, for example, 29656945 + ... + 30433182.
It is an arithmetic number, because the mean of its divisors is an integer number (1980991249776).
Almost surely, 223322120001113 is an apocalyptic number.
It is an amenable number.
23322120001113 is a deficient number, since it is larger than the sum of its proper divisors (8373739995303).
23322120001113 is a wasteful number, since it uses less digits than its factorization.
23322120001113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60092624.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 23322120001113 its reverse (31110002122332), we get a palindrome (54432122123445).
The spelling of 23322120001113 in words is "twenty-three trillion, three hundred twenty-two billion, one hundred twenty million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •