Base | Representation |
---|---|
bin | 1000001111010001011… |
… | …0100000001001000111 |
3 | 111112100001122102101101 |
4 | 2003310112200021013 |
5 | 4304332323233444 |
6 | 145004421040531 |
7 | 13140312224431 |
oct | 2036426401107 |
9 | 445301572341 |
10 | 141538492999 |
11 | 55031875762 |
12 | 23520b56147 |
13 | 10468540b97 |
14 | 6bc9ab1651 |
15 | 3a35d213d4 |
hex | 20f45a0247 |
141538492999 has 4 divisors (see below), whose sum is σ = 141564949200. Its totient is φ = 141512036800.
The previous prime is 141538492867. The next prime is 141538493059. The reversal of 141538492999 is 999294835141.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 141538492999 - 213 = 141538484807 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 141538492999.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141538462999) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13220074 + ... + 13230775.
It is an arithmetic number, because the mean of its divisors is an integer number (35391237300).
Almost surely, 2141538492999 is an apocalyptic number.
141538492999 is a deficient number, since it is larger than the sum of its proper divisors (26456201).
141538492999 is an equidigital number, since it uses as much as digits as its factorization.
141538492999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26456200.
The product of its digits is 25194240, while the sum is 64.
The spelling of 141538492999 in words is "one hundred forty-one billion, five hundred thirty-eight million, four hundred ninety-two thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.402 sec. • engine limits •