Base | Representation |
---|---|
bin | 10111000101101001100111… |
… | …100110110001111111010111 |
3 | 111022112110011000002110112002 |
4 | 113011221213212301333113 |
5 | 101302141242342002021 |
6 | 555544212345145515 |
7 | 30250156666355501 |
oct | 2705514746617727 |
9 | 438473130073462 |
10 | 101543355031511 |
11 | 2a39a32775a418 |
12 | b47b94818b29b |
13 | 4487660721743 |
14 | 1b10a2046cd71 |
15 | bb1597e7450b |
hex | 5c5a679b1fd7 |
101543355031511 has 12 divisors (see below), whose sum is σ = 103394851865136. Its totient is φ = 99724335462720.
The previous prime is 101543355031507. The next prime is 101543355031529. The reversal of 101543355031511 is 115130553345101.
It is not a de Polignac number, because 101543355031511 - 22 = 101543355031507 is a prime.
It is a super-2 number, since 2×1015433550315112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101543355031411) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 18681590 + ... + 23496563.
It is an arithmetic number, because the mean of its divisors is an integer number (8616237655428).
Almost surely, 2101543355031511 is an apocalyptic number.
101543355031511 is a deficient number, since it is larger than the sum of its proper divisors (1851496833625).
101543355031511 is an frugal number, since it uses more digits than its factorization.
101543355031511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42178922 (or 42178861 counting only the distinct ones).
The product of its (nonzero) digits is 67500, while the sum is 38.
The spelling of 101543355031511 in words is "one hundred one trillion, five hundred forty-three billion, three hundred fifty-five million, thirty-one thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •