Base | Representation |
---|---|
bin | 1000101101111000111… |
… | …0000000010000101001 |
3 | 112022112211101222012220 |
4 | 2023132032000100221 |
5 | 4423200304213342 |
6 | 152444130224253 |
7 | 13551056233122 |
oct | 2133616002051 |
9 | 468484358186 |
10 | 149757101097 |
11 | 58569a8565a |
12 | 25035425089 |
13 | 11178154cb6 |
14 | 7369403049 |
15 | 3d675ee5ec |
hex | 22de380429 |
149757101097 has 32 divisors (see below), whose sum is σ = 212626259712. Its totient is φ = 93430431744.
The previous prime is 149757101077. The next prime is 149757101111. The reversal of 149757101097 is 790101757941.
It is not a de Polignac number, because 149757101097 - 28 = 149757100841 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (149757101017) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37371868 + ... + 37375874.
It is an arithmetic number, because the mean of its divisors is an integer number (6644570616).
Almost surely, 2149757101097 is an apocalyptic number.
149757101097 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
149757101097 is a deficient number, since it is larger than the sum of its proper divisors (62869158615).
149757101097 is a wasteful number, since it uses less digits than its factorization.
149757101097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8017.
The product of its (nonzero) digits is 555660, while the sum is 51.
The spelling of 149757101097 in words is "one hundred forty-nine billion, seven hundred fifty-seven million, one hundred one thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •