Base | Representation |
---|---|
bin | 1010100110001011110001… |
… | …01011010100000111100001 |
3 | 10001111200002221010022222022 |
4 | 11103011320223110013201 |
5 | 11023240422340420223 |
6 | 121320520524151225 |
7 | 4623346534425356 |
oct | 523057053240741 |
9 | 101450087108868 |
10 | 23302222201313 |
11 | 7474464a43820 |
12 | 2744163098515 |
13 | 100050c148253 |
14 | 5a7b9547262d |
15 | 2a6226dddac8 |
hex | 153178ad41e1 |
23302222201313 has 4 divisors (see below), whose sum is σ = 25420606037808. Its totient is φ = 21183838364820.
The previous prime is 23302222201301. The next prime is 23302222201333. The reversal of 23302222201313 is 31310222220332.
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 23302222201313 - 26 = 23302222201249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23302222201333) 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, 1059191918231 + ... + 1059191918252.
It is an arithmetic number, because the mean of its divisors is an integer number (6355151509452).
Almost surely, 223302222201313 is an apocalyptic number.
It is an amenable number.
23302222201313 is a deficient number, since it is larger than the sum of its proper divisors (2118383836495).
23302222201313 is a wasteful number, since it uses less digits than its factorization.
23302222201313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2118383836494.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 23302222201313 its reverse (31310222220332), we get a palindrome (54612444421645).
The spelling of 23302222201313 in words is "twenty-three trillion, three hundred two billion, two hundred twenty-two million, two hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •