Base | Representation |
---|---|
bin | 11110001111110001100100… |
… | …000010101111010000000100 |
3 | 122110000002211020021021011201 |
4 | 132033301210002233100010 |
5 | 114413442012303444030 |
6 | 1150531005550112244 |
7 | 40006524362336503 |
oct | 3617614402572004 |
9 | 573002736237151 |
10 | 133025405531140 |
11 | 39427837503531 |
12 | 12b0526b1ab684 |
13 | 592c31b648645 |
14 | 24bc66d24283a |
15 | 105a4693b72ca |
hex | 78fc640af404 |
133025405531140 has 48 divisors (see below), whose sum is σ = 279853820769600. Its totient is φ = 53114878957952.
The previous prime is 133025405531131. The next prime is 133025405531143. The reversal of 133025405531140 is 41135504520331.
It is a self number, because there is not a number n which added to its sum of digits gives 133025405531140.
It is not an unprimeable number, because it can be changed into a prime (133025405531143) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 46846422 + ... + 49604818.
It is an arithmetic number, because the mean of its divisors is an integer number (5830287932700).
Almost surely, 2133025405531140 is an apocalyptic number.
133025405531140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133025405531140 is an abundant number, since it is smaller than the sum of its proper divisors (146828415238460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133025405531140 is a wasteful number, since it uses less digits than its factorization.
133025405531140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2762724 (or 2762722 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 37.
The spelling of 133025405531140 in words is "one hundred thirty-three trillion, twenty-five billion, four hundred five million, five hundred thirty-one thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •