Base | Representation |
---|---|
bin | 1000110000111001100… |
… | …1000101001110000100 |
3 | 112101122011012022021111 |
4 | 2030032121011032010 |
5 | 4431324204430424 |
6 | 153100241054404 |
7 | 13610102013226 |
oct | 2141631051604 |
9 | 471564168244 |
10 | 150565311364 |
11 | 58944213a26 |
12 | 25220027404 |
13 | 11276720c20 |
14 | 74048a8416 |
15 | 3db3549194 |
hex | 230e645384 |
150565311364 has 24 divisors (see below), whose sum is σ = 283770005400. Its totient is φ = 69488669184.
The previous prime is 150565311359. The next prime is 150565311427. The reversal of 150565311364 is 463113565051.
It can be written as a sum of positive squares in 4 ways, for example, as 16907800900 + 133657510464 = 130030^2 + 365592^2 .
It is a super-2 number, since 2×1505653113642 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1535802 + ... + 1630894.
It is an arithmetic number, because the mean of its divisors is an integer number (11823750225).
Almost surely, 2150565311364 is an apocalyptic number.
It is an amenable number.
150565311364 is a deficient number, since it is larger than the sum of its proper divisors (133204694036).
150565311364 is a wasteful number, since it uses less digits than its factorization.
150565311364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125559 (or 125557 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 40.
The spelling of 150565311364 in words is "one hundred fifty billion, five hundred sixty-five million, three hundred eleven thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •