Base | Representation |
---|---|
bin | 1010100110110001001110… |
… | …10001100110011001000011 |
3 | 10001120121000101000112122122 |
4 | 11103120213101212121003 |
5 | 11024103113310424103 |
6 | 121334044152554455 |
7 | 4624661053336022 |
oct | 523304721463103 |
9 | 101517011015578 |
10 | 23322331342403 |
11 | 7481a44038095 |
12 | 27480356b2a2b |
13 | 10023953172c2 |
14 | 5a8b420488b9 |
15 | 2a6a02517b38 |
hex | 153627466643 |
23322331342403 has 4 divisors (see below), whose sum is σ = 23322347626248. Its totient is φ = 23322315058560.
The previous prime is 23322331342381. The next prime is 23322331342469. The reversal of 23322331342403 is 30424313322332.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23322331342403 - 218 = 23322331080259 is a prime.
It is a super-2 number, since 2×233223313424032 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23322331342603) 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, 5761601 + ... + 8935362.
It is an arithmetic number, because the mean of its divisors is an integer number (5830586906562).
Almost surely, 223322331342403 is an apocalyptic number.
23322331342403 is a deficient number, since it is larger than the sum of its proper divisors (16283845).
23322331342403 is a wasteful number, since it uses less digits than its factorization.
23322331342403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16283844.
The product of its (nonzero) digits is 186624, while the sum is 35.
Adding to 23322331342403 its reverse (30424313322332), we get a palindrome (53746644664735).
The spelling of 23322331342403 in words is "twenty-three trillion, three hundred twenty-two billion, three hundred thirty-one million, three hundred forty-two thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •