Base | Representation |
---|---|
bin | 1000001101101110110… |
… | …1101010000011011001 |
3 | 111111021020211112101110 |
4 | 2003123231222003121 |
5 | 4303011013220010 |
6 | 144455413210533 |
7 | 13124132556000 |
oct | 2033355520331 |
9 | 444236745343 |
10 | 141125132505 |
11 | 5493a504915 |
12 | 23426630a49 |
13 | 10400a02286 |
14 | 6b8ac2dc37 |
15 | 3a0e8be120 |
hex | 20dbb6a0d9 |
141125132505 has 64 divisors (see below), whose sum is σ = 263552601600. Its totient is φ = 64458309888.
The previous prime is 141125132327. The next prime is 141125132531. The reversal of 141125132505 is 505231521141.
141125132505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 141125132505 - 212 = 141125128409 is a prime.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 6229579 + ... + 6252191.
It is an arithmetic number, because the mean of its divisors is an integer number (4118009400).
Almost surely, 2141125132505 is an apocalyptic number.
141125132505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
141125132505 is a deficient number, since it is larger than the sum of its proper divisors (122427469095).
141125132505 is a wasteful number, since it uses less digits than its factorization.
141125132505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23855 (or 23841 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 30.
Adding to 141125132505 its reverse (505231521141), we get a palindrome (646356653646).
The spelling of 141125132505 in words is "one hundred forty-one billion, one hundred twenty-five million, one hundred thirty-two thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •