Base | Representation |
---|---|
bin | 1000101111010111100… |
… | …1101100111001100100 |
3 | 112100120112001110212222 |
4 | 2023311321230321210 |
5 | 4430004013311400 |
6 | 152551402331512 |
7 | 13563652420421 |
oct | 2136571547144 |
9 | 470515043788 |
10 | 150154432100 |
11 | 58753298292 |
12 | 251264b9b98 |
13 | 1120c5707ba |
14 | 73a60b0d48 |
15 | 3d8c437185 |
hex | 22f5e6ce64 |
150154432100 has 18 divisors (see below), whose sum is σ = 325835117874. Its totient is φ = 60061772800.
The previous prime is 150154432049. The next prime is 150154432121. The reversal of 150154432100 is 1234451051.
It can be written as a sum of positive squares in 3 ways, for example, as 18112314724 + 132042117376 = 134582^2 + 363376^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 150154432100.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 750772061 + ... + 750772260.
It is an arithmetic number, because the mean of its divisors is an integer number (18101950993).
Almost surely, 2150154432100 is an apocalyptic number.
150154432100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
150154432100 is an abundant number, since it is smaller than the sum of its proper divisors (175680685774).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150154432100 is a wasteful number, since it uses less digits than its factorization.
150154432100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1501544335 (or 1501544328 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 150154432100 its reverse (1234451051), we get a palindrome (151388883151).
The spelling of 150154432100 in words is "one hundred fifty billion, one hundred fifty-four million, four hundred thirty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •