Base | Representation |
---|---|
bin | 11111010001011110100… |
… | …111110100101010000101 |
3 | 21121110010110111200011000 |
4 | 133101132213310222011 |
5 | 240202244203124410 |
6 | 4323134125003513 |
7 | 311156662223016 |
oct | 37213647645205 |
9 | 7543113450130 |
10 | 2149071145605 |
11 | 7594636a997a |
12 | 2a86076b3599 |
13 | 12786c556737 |
14 | 76030b3300d |
15 | 3ad80280dc0 |
hex | 1f45e9f4a85 |
2149071145605 has 128 divisors (see below), whose sum is σ = 4007456893440. Its totient is φ = 1091479173120.
The previous prime is 2149071145583. The next prime is 2149071145621. The reversal of 2149071145605 is 5065411709412.
2149071145605 is a `hidden beast` number, since 2 + 1 + 4 + 9 + 0 + 71 + 14 + 560 + 5 = 666.
It is not a de Polignac number, because 2149071145605 - 27 = 2149071145477 is a prime.
It is a super-2 number, since 2×21490711456052 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
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 127 ways as a sum of consecutive naturals, for example, 637137699 + ... + 637141071.
It is an arithmetic number, because the mean of its divisors is an integer number (31308256980).
Almost surely, 22149071145605 is an apocalyptic number.
It is an amenable number.
2149071145605 is a deficient number, since it is larger than the sum of its proper divisors (1858385747835).
2149071145605 is a wasteful number, since it uses less digits than its factorization.
2149071145605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6148 (or 6142 counting only the distinct ones).
The product of its (nonzero) digits is 302400, while the sum is 45.
The spelling of 2149071145605 in words is "two trillion, one hundred forty-nine billion, seventy-one million, one hundred forty-five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •