Base | Representation |
---|---|
bin | 111000101000110110… |
… | …0000011100000001000 |
3 | 102121221120112020020201 |
4 | 1301101230003200020 |
5 | 3443044133244324 |
6 | 131513104101544 |
7 | 11534044302160 |
oct | 1612154034010 |
9 | 377846466221 |
10 | 121629587464 |
11 | 47645805320 |
12 | 1b6a56048b4 |
13 | b6149ac3c8 |
14 | 5c5b93d5a0 |
15 | 326d09b444 |
hex | 1c51b03808 |
121629587464 has 128 divisors (see below), whose sum is σ = 291552307200. Its totient is φ = 46186560000.
The previous prime is 121629587411. The next prime is 121629587473. The reversal of 121629587464 is 464785926121.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 36644797 + ... + 36648115.
It is an arithmetic number, because the mean of its divisors is an integer number (2277752400).
Almost surely, 2121629587464 is an apocalyptic number.
121629587464 is a gapful number since it is divisible by the number (14) 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 121629587464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145776153600).
121629587464 is an abundant number, since it is smaller than the sum of its proper divisors (169922719736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121629587464 is a wasteful number, since it uses less digits than its factorization.
121629587464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4835 (or 4831 counting only the distinct ones).
The product of its digits is 5806080, while the sum is 55.
The spelling of 121629587464 in words is "one hundred twenty-one billion, six hundred twenty-nine million, five hundred eighty-seven thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •