Base | Representation |
---|---|
bin | 1000110010110000000… |
… | …0101010011101010010 |
3 | 112102220210020020001210 |
4 | 2030230000222131102 |
5 | 4433333412224040 |
6 | 153221431440550 |
7 | 13625314512210 |
oct | 2145400523522 |
9 | 472823206053 |
10 | 151062226770 |
11 | 59079763914 |
12 | 2533a526156 |
13 | 11325666000 |
14 | 7450899cb0 |
15 | 3de1ea3480 |
hex | 232c02a752 |
151062226770 has 128 divisors (see below), whose sum is σ = 448856271360. Its totient is φ = 31872372480.
The previous prime is 151062226751. The next prime is 151062226771. The reversal of 151062226770 is 77622260151.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (151062226771) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 297660 + ... + 625080.
It is an arithmetic number, because the mean of its divisors is an integer number (3506689620).
Almost surely, 2151062226770 is an apocalyptic number.
151062226770 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 151062226770, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (224428135680).
151062226770 is an abundant number, since it is smaller than the sum of its proper divisors (297794044590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151062226770 is a wasteful number, since it uses less digits than its factorization.
151062226770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327477 (or 327451 counting only the distinct ones).
The product of its (nonzero) digits is 70560, while the sum is 39.
The spelling of 151062226770 in words is "one hundred fifty-one billion, sixty-two million, two hundred twenty-six thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •