Base | Representation |
---|---|
bin | 1000101101100101101… |
… | …1010100011000010001 |
3 | 112022100020010102220200 |
4 | 2023121123110120101 |
5 | 4423014214032142 |
6 | 152432135125413 |
7 | 13546062001050 |
oct | 2133133243021 |
9 | 468306112820 |
10 | 149676705297 |
11 | 58528664049 |
12 | 25012513869 |
13 | 111645b6712 |
14 | 735c876397 |
15 | 3d6051d64c |
hex | 22d96d4611 |
149676705297 has 48 divisors (see below), whose sum is σ = 263314022400. Its totient is φ = 80070176736.
The previous prime is 149676705253. The next prime is 149676705319. The reversal of 149676705297 is 792507676941.
149676705297 is a `hidden beast` number, since 1 + 49 + 6 + 7 + 67 + 0 + 529 + 7 = 666.
It is not a de Polignac number, because 149676705297 - 28 = 149676705041 is a prime.
It is a super-2 number, since 2×1496767052972 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is not an unprimeable number, because it can be changed into a prime (149676705797) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1030797 + ... + 1167002.
It is an arithmetic number, because the mean of its divisors is an integer number (5485708800).
Almost surely, 2149676705297 is an apocalyptic number.
It is an amenable number.
149676705297 is a deficient number, since it is larger than the sum of its proper divisors (113637317103).
149676705297 is a wasteful number, since it uses less digits than its factorization.
149676705297 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2197882 (or 2197879 counting only the distinct ones).
The product of its (nonzero) digits is 40007520, while the sum is 63.
The spelling of 149676705297 in words is "one hundred forty-nine billion, six hundred seventy-six million, seven hundred five thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •