Base | Representation |
---|---|
bin | 11111000000110110101… |
… | …000010110110000110101 |
3 | 21112202001102001011011212 |
4 | 133000312220112300311 |
5 | 234404214400434402 |
6 | 4311022532011205 |
7 | 306655424612333 |
oct | 37006650266065 |
9 | 7482042034155 |
10 | 2131220327477 |
11 | 75193335001a |
12 | 2a5065460b05 |
13 | 125c861c9867 |
14 | 7521a05ab53 |
15 | 3a688044952 |
hex | 1f036a16c35 |
2131220327477 has 16 divisors (see below), whose sum is σ = 2186473622592. Its totient is φ = 2076124625280.
The previous prime is 2131220327459. The next prime is 2131220327491. The reversal of 2131220327477 is 7747230221312.
It is a cyclic number.
It is not a de Polignac number, because 2131220327477 - 212 = 2131220323381 is a prime.
It is a super-2 number, since 2×21312203274772 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2131220327377) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 118900838 + ... + 118918760.
It is an arithmetic number, because the mean of its divisors is an integer number (136654601412).
Almost surely, 22131220327477 is an apocalyptic number.
It is an amenable number.
2131220327477 is a deficient number, since it is larger than the sum of its proper divisors (55253295115).
2131220327477 is a wasteful number, since it uses less digits than its factorization.
2131220327477 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22148.
The product of its (nonzero) digits is 197568, while the sum is 41.
Adding to 2131220327477 its reverse (7747230221312), we get a palindrome (9878450548789).
The spelling of 2131220327477 in words is "two trillion, one hundred thirty-one billion, two hundred twenty million, three hundred twenty-seven thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •