Base | Representation |
---|---|
bin | 11110010111101000010011… |
… | …110110100100010001010010 |
3 | 122111220201012020210112201110 |
4 | 132113220103312210101102 |
5 | 120001313040331324300 |
6 | 1152023003501114150 |
7 | 40063524546101256 |
oct | 3627502366442122 |
9 | 574821166715643 |
10 | 133565226042450 |
11 | 39615770076504 |
12 | 12b91a03b58956 |
13 | 596b1ba5c3737 |
14 | 24da83cc70266 |
15 | 1069510d7a550 |
hex | 797a13da4452 |
133565226042450 has 96 divisors (see below), whose sum is σ = 337542099851520. Its totient is φ = 34942396820800.
The previous prime is 133565226042377. The next prime is 133565226042467. The reversal of 133565226042450 is 54240622565331.
It is a self number, because there is not a number n which added to its sum of digits gives 133565226042450.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11023404 + ... + 19714103.
It is an arithmetic number, because the mean of its divisors is an integer number (3516063540120).
Almost surely, 2133565226042450 is an apocalyptic number.
133565226042450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133565226042450 is an abundant number, since it is smaller than the sum of its proper divisors (203976873809070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133565226042450 is a wasteful number, since it uses less digits than its factorization.
133565226042450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30738072 (or 30738067 counting only the distinct ones).
The product of its (nonzero) digits is 5184000, while the sum is 48.
The spelling of 133565226042450 in words is "one hundred thirty-three trillion, five hundred sixty-five billion, two hundred twenty-six million, forty-two thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •