Base | Representation |
---|---|
bin | 1010100110110001001110… |
… | …01100011110111110100001 |
3 | 10001120121000021111102000122 |
4 | 11103120213030132332201 |
5 | 11024103112440020223 |
6 | 121334044104130025 |
7 | 4624661036052110 |
oct | 523304714367641 |
9 | 101517007442018 |
10 | 23322330001313 |
11 | 7481a43301552 |
12 | 2748035166915 |
13 | 1002394c67a65 |
14 | 5a8b41bb9c77 |
15 | 2a6a023505c8 |
hex | 15362731efa1 |
23322330001313 has 4 divisors (see below), whose sum is σ = 26654091430080. Its totient is φ = 19990568572548.
The previous prime is 23322330001291. The next prime is 23322330001429. The reversal of 23322330001313 is 31310003322332.
It is a happy number.
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 not a de Polignac number, because 23322330001313 - 28 = 23322330001057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23322330001513) 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, 1665880714373 + ... + 1665880714386.
It is an arithmetic number, because the mean of its divisors is an integer number (6663522857520).
Almost surely, 223322330001313 is an apocalyptic number.
It is an amenable number.
23322330001313 is a deficient number, since it is larger than the sum of its proper divisors (3331761428767).
23322330001313 is an equidigital number, since it uses as much as digits as its factorization.
23322330001313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3331761428766.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 23322330001313 its reverse (31310003322332), we get a palindrome (54632333323645).
The spelling of 23322330001313 in words is "twenty-three trillion, three hundred twenty-two billion, three hundred thirty million, one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •