Base | Representation |
---|---|
bin | 10111000101100001001000… |
… | …011011010111111101101010 |
3 | 111022111120121220100011022020 |
4 | 113011201020123113331222 |
5 | 101302014111423404114 |
6 | 555540104205405310 |
7 | 30246415112111505 |
oct | 2705411033277552 |
9 | 438446556304266 |
10 | 101534242013034 |
11 | 2a396480695796 |
12 | b47a024269836 |
13 | 448683a72020c |
14 | 1b103d803813c |
15 | bb1212dc0aa9 |
hex | 5c58486d7f6a |
101534242013034 has 16 divisors (see below), whose sum is σ = 203132604204288. Its totient is φ = 33834060641312.
The previous prime is 101534242013021. The next prime is 101534242013063. The reversal of 101534242013034 is 430310242435101.
It is a super-3 number, since 3×1015342420130343 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 101534242012986 and 101534242013004.
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, 2671653507 + ... + 2671691510.
It is an arithmetic number, because the mean of its divisors is an integer number (12695787762768).
Almost surely, 2101534242013034 is an apocalyptic number.
101534242013034 is an abundant number, since it is smaller than the sum of its proper divisors (101598362191254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101534242013034 is a wasteful number, since it uses less digits than its factorization.
101534242013034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5343348189.
The product of its (nonzero) digits is 34560, while the sum is 33.
Adding to 101534242013034 its reverse (430310242435101), we get a palindrome (531844484448135).
The spelling of 101534242013034 in words is "one hundred one trillion, five hundred thirty-four billion, two hundred forty-two million, thirteen thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •