Base | Representation |
---|---|
bin | 10110111111100000010011… |
… | …011001101111110011000000 |
3 | 111021001002001211110010011221 |
4 | 112333200103121233303000 |
5 | 101223231340044033004 |
6 | 555022210140444424 |
7 | 30204516346020640 |
oct | 2677402331576300 |
9 | 437032054403157 |
10 | 101121035533504 |
11 | 2a24721037a8a8 |
12 | b411b26249714 |
13 | 4456898cc785c |
14 | 1ad83d9d1c520 |
15 | ba55cbd8b354 |
hex | 5bf81366fcc0 |
101121035533504 has 56 divisors (see below), whose sum is σ = 237235926990240. Its totient is φ = 41843187111936.
The previous prime is 101121035533481. The next prime is 101121035533541. The reversal of 101121035533504 is 405335530121101.
It is a tau number, because it is divible by the number of its divisors (56).
It is a self number, because there is not a number n which added to its sum of digits gives 101121035533504.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3891652477 + ... + 3891678460.
Almost surely, 2101121035533504 is an apocalyptic number.
101121035533504 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
101121035533504 is an abundant number, since it is smaller than the sum of its proper divisors (136114891456736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101121035533504 is an equidigital number, since it uses as much as digits as its factorization.
101121035533504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7783330985 (or 7783330975 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 34.
Adding to 101121035533504 its reverse (405335530121101), we get a palindrome (506456565654605).
The spelling of 101121035533504 in words is "one hundred one trillion, one hundred twenty-one billion, thirty-five million, five hundred thirty-three thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •