Base | Representation |
---|---|
bin | 1000101101011000111… |
… | …0101100110110110000 |
3 | 112022012111012021200020 |
4 | 2023112032230312300 |
5 | 4422412001103112 |
6 | 152422541323440 |
7 | 13544541035256 |
oct | 2132616546660 |
9 | 468174167606 |
10 | 149623066032 |
11 | 58500358080 |
12 | 24bb8566580 |
13 | 111564559cb |
14 | 73556b25d6 |
15 | 3d5a97548c |
hex | 22d63acdb0 |
149623066032 has 80 divisors (see below), whose sum is σ = 424457713920. Its totient is φ = 45040032000.
The previous prime is 149623065997. The next prime is 149623066039. The reversal of 149623066032 is 230660326941.
149623066032 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (149623066039) by changing a digit.
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 in 15 ways as a sum of consecutive naturals, for example, 858607 + ... + 1018062.
It is an arithmetic number, because the mean of its divisors is an integer number (5305721424).
Almost surely, 2149623066032 is an apocalyptic number.
149623066032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
149623066032 is an abundant number, since it is smaller than the sum of its proper divisors (274834647888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149623066032 is a wasteful number, since it uses less digits than its factorization.
149623066032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1876842 (or 1876836 counting only the distinct ones).
The product of its (nonzero) digits is 279936, while the sum is 42.
The spelling of 149623066032 in words is "one hundred forty-nine billion, six hundred twenty-three million, sixty-six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •