Base | Representation |
---|---|
bin | 1000110111000001111… |
… | …0111111111111110000 |
3 | 112112212211220110211120 |
4 | 2031300132333333300 |
5 | 4443212010430000 |
6 | 153531430342240 |
7 | 13665634256601 |
oct | 2156036777760 |
9 | 475784813746 |
10 | 152211030000 |
11 | 59609181777 |
12 | 255bb1ba980 |
13 | 11479673433 |
14 | 751d29dda8 |
15 | 3e5cc796a0 |
hex | 23707bfff0 |
152211030000 has 400 divisors, whose sum is σ = 523738550016. Its totient is φ = 37946880000.
The previous prime is 152211029989. The next prime is 152211030029. The reversal of 152211030000 is 30112251.
It is a tau number, because it is divible by the number of its divisors (400).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 83129085 + ... + 83130915.
Almost surely, 2152211030000 is an apocalyptic number.
152211030000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 152211030000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (261869275008).
152211030000 is an abundant number, since it is smaller than the sum of its proper divisors (371527520016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152211030000 is a wasteful number, since it uses less digits than its factorization.
152211030000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2042 (or 2021 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 15.
Adding to 152211030000 its reverse (30112251), we get a palindrome (152241142251).
The spelling of 152211030000 in words is "one hundred fifty-two billion, two hundred eleven million, thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •