Base | Representation |
---|---|
bin | 111010101100111011… |
… | …1000010000010100000 |
3 | 110001101110020100011222 |
4 | 1311121313002002200 |
5 | 4031133240300310 |
6 | 133524550354212 |
7 | 12051632226422 |
oct | 1653167020240 |
9 | 401343210158 |
10 | 126061650080 |
11 | 4950a573593 |
12 | 2052195b968 |
13 | bb6cc8a172 |
14 | 615c402812 |
15 | 342c21a055 |
hex | 1d59dc20a0 |
126061650080 has 96 divisors (see below), whose sum is σ = 301233510144. Its totient is φ = 49848016896.
The previous prime is 126061650067. The next prime is 126061650097. The reversal of 126061650080 is 80056160621.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 126061650080.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15252029 + ... + 15260291.
It is an arithmetic number, because the mean of its divisors is an integer number (3137849064).
Almost surely, 2126061650080 is an apocalyptic number.
126061650080 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 126061650080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150616755072).
126061650080 is an abundant number, since it is smaller than the sum of its proper divisors (175171860064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126061650080 is an equidigital number, since it uses as much as digits as its factorization.
126061650080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9358 (or 9350 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 35.
The spelling of 126061650080 in words is "one hundred twenty-six billion, sixty-one million, six hundred fifty thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •