Base | Representation |
---|---|
bin | 1000111111100110000… |
… | …0100010010000001010 |
3 | 112202211001122201210011 |
4 | 2033321200202100022 |
5 | 10012414014123200 |
6 | 154551511342134 |
7 | 14106620400655 |
oct | 2177140422012 |
9 | 482731581704 |
10 | 154509911050 |
11 | 5a5888a9070 |
12 | 25b4108194a |
13 | 11754a16191 |
14 | 769a71a89c |
15 | 40449c95ba |
hex | 23f982240a |
154509911050 has 48 divisors (see below), whose sum is σ = 313777041984. Its totient is φ = 56138400000.
The previous prime is 154509911047. The next prime is 154509911051. The reversal of 154509911050 is 50119905451.
It is a super-2 number, since 2×1545099110502 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 154509910994 and 154509911012.
It is not an unprimeable number, because it can be changed into a prime (154509911051) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 543595 + ... + 777505.
It is an arithmetic number, because the mean of its divisors is an integer number (6537021708).
Almost surely, 2154509911050 is an apocalyptic number.
154509911050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
154509911050 is an abundant number, since it is smaller than the sum of its proper divisors (159267130934).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
154509911050 is a wasteful number, since it uses less digits than its factorization.
154509911050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235135 (or 235130 counting only the distinct ones).
The product of its (nonzero) digits is 40500, while the sum is 40.
The spelling of 154509911050 in words is "one hundred fifty-four billion, five hundred nine million, nine hundred eleven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •