Base | Representation |
---|---|
bin | 1000111101100000100… |
… | …0111000001000000000 |
3 | 112201101001012101222012 |
4 | 2033120020320020000 |
5 | 10010242203423211 |
6 | 154420152032052 |
7 | 14060011633151 |
oct | 2173010701000 |
9 | 481331171865 |
10 | 153950061056 |
11 | 5a320883520 |
12 | 25a05692628 |
13 | 11695a374ac |
14 | 7646225928 |
15 | 401078cd8b |
hex | 23d8238200 |
153950061056 has 80 divisors (see below), whose sum is σ = 335691639360. Its totient is φ = 69950484480.
The previous prime is 153950061047. The next prime is 153950061077. The reversal of 153950061056 is 650160059351.
It is a happy number.
It is a super-2 number, since 2×1539500610562 (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, 27701030 + ... + 27706586.
It is an arithmetic number, because the mean of its divisors is an integer number (4196145492).
Almost surely, 2153950061056 is an apocalyptic number.
153950061056 is a gapful number since it is divisible by the number (16) 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 153950061056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167845819680).
153950061056 is an abundant number, since it is smaller than the sum of its proper divisors (181741578304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153950061056 is an equidigital number, since it uses as much as digits as its factorization.
153950061056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10505 (or 10489 counting only the distinct ones).
The product of its (nonzero) digits is 121500, while the sum is 41.
The spelling of 153950061056 in words is "one hundred fifty-three billion, nine hundred fifty million, sixty-one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •