Base | Representation |
---|---|
bin | 11101100001110010011… |
… | …000111011111001101010 |
3 | 21011222120111212100212220 |
4 | 131201302120323321222 |
5 | 231221141242000041 |
6 | 4152101543414510 |
7 | 266413033615440 |
oct | 35416230737152 |
9 | 7158514770786 |
10 | 2029143703146 |
11 | 7126117a236a |
12 | 289318154436 |
13 | 1194693c5031 |
14 | 702d52b6b90 |
15 | 37bb185dd66 |
hex | 1d87263be6a |
2029143703146 has 16 divisors (see below), whose sum is σ = 4638042750144. Its totient is φ = 579755343744.
The previous prime is 2029143703123. The next prime is 2029143703177. The reversal of 2029143703146 is 6413073419202.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42), and also a Moran number because the ratio is a prime number: 48312945313 = 2029143703146 / (2 + 0 + 2 + 9 + 1 + 4 + 3 + 7 + 0 + 3 + 1 + 4 + 6).
It is a junction number, because it is equal to n+sod(n) for n = 2029143703098 and 2029143703107.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24156472615 + ... + 24156472698.
It is an arithmetic number, because the mean of its divisors is an integer number (289877671884).
Almost surely, 22029143703146 is an apocalyptic number.
2029143703146 is an abundant number, since it is smaller than the sum of its proper divisors (2608899046998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2029143703146 is a wasteful number, since it uses less digits than its factorization.
2029143703146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48312945325.
The product of its (nonzero) digits is 217728, while the sum is 42.
The spelling of 2029143703146 in words is "two trillion, twenty-nine billion, one hundred forty-three million, seven hundred three thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •