Base | Representation |
---|---|
bin | 10111000101101001100111… |
… | …100110101101110001001101 |
3 | 111022112110011000001120210201 |
4 | 113011221213212231301031 |
5 | 101302141242340423341 |
6 | 555544212344533501 |
7 | 30250156666254211 |
oct | 2705514746556115 |
9 | 438473130046721 |
10 | 101543355014221 |
11 | 2a39a32774842a |
12 | b47b948181291 |
13 | 4487660716903 |
14 | 1b10a20466941 |
15 | bb1597e6e331 |
hex | 5c5a679adc4d |
101543355014221 has 8 divisors (see below), whose sum is σ = 101862944935488. Its totient is φ = 101224267200000.
The previous prime is 101543355014197. The next prime is 101543355014243. The reversal of 101543355014221 is 122410553345101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101543355014221 - 231 = 101541207530573 is a prime.
It is a super-2 number, since 2×1015433550142212 (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 (101543355054221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 125121655 + ... + 125930596.
It is an arithmetic number, because the mean of its divisors is an integer number (12732868116936).
Almost surely, 2101543355014221 is an apocalyptic number.
It is an amenable number.
101543355014221 is a deficient number, since it is larger than the sum of its proper divisors (319589921267).
101543355014221 is an equidigital number, since it uses as much as digits as its factorization.
101543355014221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 251053523.
The product of its (nonzero) digits is 72000, while the sum is 37.
The spelling of 101543355014221 in words is "one hundred one trillion, five hundred forty-three billion, three hundred fifty-five million, fourteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •