Base | Representation |
---|---|
bin | 100000000100110110001100… |
… | …000101001010011110110111 |
3 | 200111111012202020211011020211 |
4 | 200010312030011022132313 |
5 | 121442244442024013030 |
6 | 1220010525542210251 |
7 | 41500003522455526 |
oct | 4004661405123667 |
9 | 614435666734224 |
10 | 141070551001015 |
11 | 40a4975937a449 |
12 | 139a4502123987 |
13 | 6093b8532488c |
14 | 26b9bcb5ba4bd |
15 | 114987e90312a |
hex | 804d8c14a7b7 |
141070551001015 has 4 divisors (see below), whose sum is σ = 169284661201224. Its totient is φ = 112856440800808.
The previous prime is 141070551000949. The next prime is 141070551001019. The reversal of 141070551001015 is 510100155070141.
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 141070551001015 - 229 = 141070014130103 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141070551001019) 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, 14107055100097 + ... + 14107055100106.
It is an arithmetic number, because the mean of its divisors is an integer number (42321165300306).
Almost surely, 2141070551001015 is an apocalyptic number.
141070551001015 is a deficient number, since it is larger than the sum of its proper divisors (28214110200209).
141070551001015 is an equidigital number, since it uses as much as digits as its factorization.
141070551001015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28214110200208.
The product of its (nonzero) digits is 3500, while the sum is 31.
The spelling of 141070551001015 in words is "one hundred forty-one trillion, seventy billion, five hundred fifty-one million, one thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •