Base | Representation |
---|---|
bin | 11101100011111111100… |
… | …011110010011110110101 |
3 | 21012012200120111012102121 |
4 | 131203333203302132311 |
5 | 231241014101314410 |
6 | 4153132551235541 |
7 | 266525523144361 |
oct | 35437743623665 |
9 | 7165616435377 |
10 | 2031512135605 |
11 | 713617703767 |
12 | 289879378bb1 |
13 | 119755caa364 |
14 | 7047ba7a2a1 |
15 | 37c9e74b9da |
hex | 1d8ff8f27b5 |
2031512135605 has 4 divisors (see below), whose sum is σ = 2437814562732. Its totient is φ = 1625209708480.
The previous prime is 2031512135599. The next prime is 2031512135657. The reversal of 2031512135605 is 5065312151302.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 228505032484 + 1803007103121 = 478022^2 + 1342761^2 .
It is a de Polignac number, because none of the positive numbers 2k-2031512135605 is a prime.
It is a super-2 number, since 2×20315121356052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 203151213556 + ... + 203151213565.
It is an arithmetic number, because the mean of its divisors is an integer number (609453640683).
Almost surely, 22031512135605 is an apocalyptic number.
It is an amenable number.
2031512135605 is a deficient number, since it is larger than the sum of its proper divisors (406302427127).
2031512135605 is an equidigital number, since it uses as much as digits as its factorization.
2031512135605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406302427126.
The product of its (nonzero) digits is 27000, while the sum is 34.
Adding to 2031512135605 its reverse (5065312151302), we get a palindrome (7096824286907).
The spelling of 2031512135605 in words is "two trillion, thirty-one billion, five hundred twelve million, one hundred thirty-five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •