Base | Representation |
---|---|
bin | 11110010001001011000110… |
… | …110000100110001111000000 |
3 | 122110100021222202221011102210 |
4 | 132101023012300212033000 |
5 | 114422030414024004022 |
6 | 1151043110221142120 |
7 | 40016500063341414 |
oct | 3621130660461700 |
9 | 573307882834383 |
10 | 133121551000512 |
11 | 39464595082728 |
12 | 12b1ba220ba940 |
13 | 593840170a319 |
14 | 24c31903b8d44 |
15 | 105cbe5013a0c |
hex | 7912c6c263c0 |
133121551000512 has 28 divisors (see below), whose sum is σ = 352217437022696. Its totient is φ = 44373850333440.
The previous prime is 133121551000447. The next prime is 133121551000531. The reversal of 133121551000512 is 215000155121331.
It is a self number, because there is not a number n which added to its sum of digits gives 133121551000512.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 346670705539 + ... + 346670705922.
It is an arithmetic number, because the mean of its divisors is an integer number (12579194179382).
Almost surely, 2133121551000512 is an apocalyptic number.
133121551000512 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
133121551000512 is an abundant number, since it is smaller than the sum of its proper divisors (219095886022184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133121551000512 is an equidigital number, since it uses as much as digits as its factorization.
133121551000512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 693341411476 (or 693341411466 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 30.
The spelling of 133121551000512 in words is "one hundred thirty-three trillion, one hundred twenty-one billion, five hundred fifty-one million, five hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •