Base | Representation |
---|---|
bin | 1000010000000111010… |
… | …1100001100010101101 |
3 | 111112220211100101211201 |
4 | 2010001311201202231 |
5 | 4310313232312010 |
6 | 145043102045501 |
7 | 13146030212554 |
oct | 2040165414255 |
9 | 445824311751 |
10 | 141764729005 |
11 | 55138548169 |
12 | 23584879891 |
13 | 104a3382b43 |
14 | 6c0bb62d9b |
15 | 3a4ab0e23a |
hex | 2101d618ad |
141764729005 has 8 divisors (see below), whose sum is σ = 170123124600. Its totient is φ = 113408150016.
The previous prime is 141764728993. The next prime is 141764729017. The reversal of 141764729005 is 500927467141.
It is an interprime number because it is at equal distance from previous prime (141764728993) and next prime (141764729017).
It can be written as a sum of positive squares in 4 ways, for example, as 7419755044 + 134344973961 = 86138^2 + 366531^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 141764729005 - 213 = 141764720813 is a prime.
It is a super-2 number, since 2×1417647290052 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 276120 + ... + 599809.
It is an arithmetic number, because the mean of its divisors is an integer number (21265390575).
Almost surely, 2141764729005 is an apocalyptic number.
It is an amenable number.
141764729005 is a deficient number, since it is larger than the sum of its proper divisors (28358395595).
141764729005 is an equidigital number, since it uses as much as digits as its factorization.
141764729005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 908303.
The product of its (nonzero) digits is 423360, while the sum is 46.
The spelling of 141764729005 in words is "one hundred forty-one billion, seven hundred sixty-four million, seven hundred twenty-nine thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •