Base | Representation |
---|---|
bin | 111101001111011100… |
… | …0001000010010110101 |
3 | 110120110110210111101022 |
4 | 1322132320020102311 |
5 | 4123320210024140 |
6 | 140230020510525 |
7 | 12334024041410 |
oct | 1723670102265 |
9 | 416413714338 |
10 | 131514533045 |
11 | 50858586235 |
12 | 215a3b4b445 |
13 | c52b8b4a2c |
14 | 65186b2b77 |
15 | 364acce0b5 |
hex | 1e9ee084b5 |
131514533045 has 16 divisors (see below), whose sum is σ = 181511603328. Its totient is φ = 89606986560.
The previous prime is 131514533039. The next prime is 131514533047. The reversal of 131514533045 is 540335415131.
It is not a de Polignac number, because 131514533045 - 28 = 131514532789 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131514532996 and 131514533014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131514533047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11961251 + ... + 11972240.
It is an arithmetic number, because the mean of its divisors is an integer number (11344475208).
Almost surely, 2131514533045 is an apocalyptic number.
It is an amenable number.
131514533045 is a deficient number, since it is larger than the sum of its proper divisors (49997070283).
131514533045 is a wasteful number, since it uses less digits than its factorization.
131514533045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23933660.
The product of its (nonzero) digits is 54000, while the sum is 35.
Adding to 131514533045 its reverse (540335415131), we get a palindrome (671849948176).
The spelling of 131514533045 in words is "one hundred thirty-one billion, five hundred fourteen million, five hundred thirty-three thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •