Base | Representation |
---|---|
bin | 10010011101001… |
… | …10010101010100 |
3 | 101210022202211010 |
4 | 21032212111110 |
5 | 304113300342 |
6 | 23210212220 |
7 | 3556652004 |
oct | 1116462524 |
9 | 353282733 |
10 | 154821972 |
11 | 7a436048 |
12 | 43a24070 |
13 | 260c9946 |
14 | 167c2004 |
15 | d8d329c |
hex | 93a6554 |
154821972 has 12 divisors (see below), whose sum is σ = 361251296. Its totient is φ = 51607320.
The previous prime is 154821943. The next prime is 154821983. The reversal of 154821972 is 279128451.
154821972 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is a self number, because there is not a number n which added to its sum of digits gives 154821972.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6450904 + ... + 6450927.
Almost surely, 2154821972 is an apocalyptic number.
154821972 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
154821972 is an abundant number, since it is smaller than the sum of its proper divisors (206429324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
154821972 is a wasteful number, since it uses less digits than its factorization.
154821972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12901838 (or 12901836 counting only the distinct ones).
The product of its digits is 40320, while the sum is 39.
The square root of 154821972 is about 12442.7477672739. The cubic root of 154821972 is about 536.9627985561.
The spelling of 154821972 in words is "one hundred fifty-four million, eight hundred twenty-one thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •