Base | Representation |
---|---|
bin | 11101111000011101101101… |
… | …101010110010000101011101 |
3 | 122020022222010202121111010120 |
4 | 131320131231222302011131 |
5 | 114211220404310101140 |
6 | 1143303050455025153 |
7 | 36453015641016345 |
oct | 3570355552620535 |
9 | 566288122544116 |
10 | 131423544222045 |
11 | 3896a459565a69 |
12 | 128a691b06b1b9 |
13 | 5844257c1779a |
14 | 2464d0d67dd25 |
15 | 102d9646b91d0 |
hex | 77876dab215d |
131423544222045 has 16 divisors (see below), whose sum is σ = 210297413539392. Its totient is φ = 70085975990400.
The previous prime is 131423544222029. The next prime is 131423544222071. The reversal of 131423544222045 is 540222445324131.
It is not a de Polignac number, because 131423544222045 - 24 = 131423544222029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131423544221988 and 131423544222006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 411142912 + ... + 411462441.
It is an arithmetic number, because the mean of its divisors is an integer number (13143588346212).
Almost surely, 2131423544222045 is an apocalyptic number.
131423544222045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
131423544222045 is a deficient number, since it is larger than the sum of its proper divisors (78873869317347).
131423544222045 is a wasteful number, since it uses less digits than its factorization.
131423544222045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 822616012.
The product of its (nonzero) digits is 921600, while the sum is 42.
Adding to 131423544222045 its reverse (540222445324131), we get a palindrome (671645989546176).
The spelling of 131423544222045 in words is "one hundred thirty-one trillion, four hundred twenty-three billion, five hundred forty-four million, two hundred twenty-two thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •