Base | Representation |
---|---|
bin | 101101110100101010010111… |
… | …101110100000010010011101 |
3 | 222102120011201222010211220122 |
4 | 231310222113232200102131 |
5 | 202403340442224412110 |
6 | 1552342021434324325 |
7 | 60310064035233410 |
oct | 5564522756402235 |
9 | 872504658124818 |
10 | 201531001013405 |
11 | 592398aa195978 |
12 | 1a72a0845896a5 |
13 | 885b3a4270aab |
14 | 37aa21c62bb77 |
15 | 184743cd94255 |
hex | b74a97ba049d |
201531001013405 has 8 divisors (see below), whose sum is σ = 276385372818432. Its totient is φ = 138192686409168.
The previous prime is 201531001013383. The next prime is 201531001013413. The reversal of 201531001013405 is 504310100135102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201531001013405 - 28 = 201531001013149 is a prime.
It is a super-2 number, since 2×2015310010134052 (a number of 29 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 7 ways as a sum of consecutive naturals, for example, 2879014300157 + ... + 2879014300226.
It is an arithmetic number, because the mean of its divisors is an integer number (34548171602304).
Almost surely, 2201531001013405 is an apocalyptic number.
It is an amenable number.
201531001013405 is a deficient number, since it is larger than the sum of its proper divisors (74854371805027).
201531001013405 is an equidigital number, since it uses as much as digits as its factorization.
201531001013405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5758028600395.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 201531001013405 its reverse (504310100135102), we get a palindrome (705841101148507).
The spelling of 201531001013405 in words is "two hundred one trillion, five hundred thirty-one billion, one million, thirteen thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •