Base | Representation |
---|---|
bin | 11110001111101111010101… |
… | …010110000101010011111110 |
3 | 122102222212122101101212110012 |
4 | 132033233111112011103332 |
5 | 114413422111413212400 |
6 | 1150525532224543222 |
7 | 40006411142146334 |
oct | 3617572526052376 |
9 | 572885571355405 |
10 | 133023011460350 |
11 | 39426819080730 |
12 | 12b04901481b12 |
13 | 592c0296576cb |
14 | 24bc4c32c7b54 |
15 | 105a379112d35 |
hex | 78fbd55854fe |
133023011460350 has 48 divisors (see below), whose sum is σ = 270731239163136. Its totient is φ = 48225865116000.
The previous prime is 133023011460331. The next prime is 133023011460397. The reversal of 133023011460350 is 53064110320331.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 365165414 + ... + 365529513.
It is an arithmetic number, because the mean of its divisors is an integer number (5640234149232).
Almost surely, 2133023011460350 is an apocalyptic number.
133023011460350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133023011460350 is an abundant number, since it is smaller than the sum of its proper divisors (137708227702786).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133023011460350 is a wasteful number, since it uses less digits than its factorization.
133023011460350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 730695281 (or 730695276 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 32.
Adding to 133023011460350 its reverse (53064110320331), we get a palindrome (186087121780681).
The spelling of 133023011460350 in words is "one hundred thirty-three trillion, twenty-three billion, eleven million, four hundred sixty thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •