Base | Representation |
---|---|
bin | 100001101100100001101… |
… | …010011101100111001101 |
3 | 22012100211210220001120022 |
4 | 201230201222131213031 |
5 | 300414222322331023 |
6 | 4531425554431525 |
7 | 326202353353442 |
oct | 41544152354715 |
9 | 8170753801508 |
10 | 2315552152013 |
11 | 813024907081 |
12 | 3149298925a5 |
13 | 13a481423b99 |
14 | 801052a59c9 |
15 | 40375bbb7c8 |
hex | 21b21a9d9cd |
2315552152013 has 4 divisors (see below), whose sum is σ = 2315591149920. Its totient is φ = 2315513154108.
The previous prime is 2315552152003. The next prime is 2315552152051. The reversal of 2315552152013 is 3102512555132.
It is a happy number.
2315552152013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2315552152013 - 218 = 2315551889869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2315552152003) 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, 19409753 + ... + 19528686.
It is an arithmetic number, because the mean of its divisors is an integer number (578897787480).
Almost surely, 22315552152013 is an apocalyptic number.
It is an amenable number.
2315552152013 is a deficient number, since it is larger than the sum of its proper divisors (38997907).
2315552152013 is an equidigital number, since it uses as much as digits as its factorization.
2315552152013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38997906.
The product of its (nonzero) digits is 45000, while the sum is 35.
The spelling of 2315552152013 in words is "two trillion, three hundred fifteen billion, five hundred fifty-two million, one hundred fifty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •