Base | Representation |
---|---|
bin | 11110011001010100111111… |
… | …011010001111010100100000 |
3 | 122112022212101220211002210120 |
4 | 132121110333122033110200 |
5 | 120010221033224243404 |
6 | 1152152343205400240 |
7 | 40105125423222450 |
oct | 3631247732172440 |
9 | 575285356732716 |
10 | 133681920931104 |
11 | 39660203315547 |
12 | 12bb0550a09080 |
13 | 59791c6b29100 |
14 | 250234d269d60 |
15 | 106c590abd9d9 |
hex | 79953f68f520 |
133681920931104 has 288 divisors, whose sum is σ = 459813700563840. Its totient is φ = 33182842208256.
The previous prime is 133681920931103. The next prime is 133681920931177. The reversal of 133681920931104 is 401139029186331.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (133681920931103) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 32690199 + ... + 36551510.
It is an arithmetic number, because the mean of its divisors is an integer number (1596575349180).
Almost surely, 2133681920931104 is an apocalyptic number.
133681920931104 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
133681920931104 is an abundant number, since it is smaller than the sum of its proper divisors (326131779632736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133681920931104 is a wasteful number, since it uses less digits than its factorization.
133681920931104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69241772 (or 69241751 counting only the distinct ones).
The product of its (nonzero) digits is 839808, while the sum is 51.
The spelling of 133681920931104 in words is "one hundred thirty-three trillion, six hundred eighty-one billion, nine hundred twenty million, nine hundred thirty-one thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •