Base | Representation |
---|---|
bin | 1000101110101011000… |
… | …0000110110111101010 |
3 | 112100002111001121201022 |
4 | 2023222300012313222 |
5 | 4424113121231113 |
6 | 152521041052442 |
7 | 13556221410143 |
oct | 2135260066752 |
9 | 470074047638 |
10 | 149967367658 |
11 | 5866773aa79 |
12 | 25093927122 |
13 | 111ac895294 |
14 | 73892d8aca |
15 | 3d7acd5908 |
hex | 22eac06dea |
149967367658 has 4 divisors (see below), whose sum is σ = 224951051490. Its totient is φ = 74983683828.
The previous prime is 149967367639. The next prime is 149967367661. The reversal of 149967367658 is 856763769941.
149967367658 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 856763769941 = 953 ⋅899017597.
It can be written as a sum of positive squares in only one way, i.e., 146793960769 + 3173406889 = 383137^2 + 56333^2 .
It is a super-2 number, since 2×1499673676582 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 149967367591 and 149967367600.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 37491841913 + ... + 37491841916.
Almost surely, 2149967367658 is an apocalyptic number.
149967367658 is a deficient number, since it is larger than the sum of its proper divisors (74983683832).
149967367658 is an equidigital number, since it uses as much as digits as its factorization.
149967367658 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74983683831.
The product of its digits is 411505920, while the sum is 71.
The spelling of 149967367658 in words is "one hundred forty-nine billion, nine hundred sixty-seven million, three hundred sixty-seven thousand, six hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •