Base | Representation |
---|---|
bin | 10111000011110111101011… |
… | …111000001101101001110110 |
3 | 111022002202101021102012000200 |
4 | 113003313223320031221312 |
5 | 101243140222124022243 |
6 | 555412101244021330 |
7 | 30235266266100561 |
oct | 2703675370155166 |
9 | 438082337365020 |
10 | 101421020142198 |
11 | 2a35245a914409 |
12 | b4600a6531846 |
13 | 4478c65897983 |
14 | 1b08b36db54d8 |
15 | bad2d8009ad3 |
hex | 5c3debe0da76 |
101421020142198 has 24 divisors (see below), whose sum is σ = 219751199811936. Its totient is φ = 33806136534000.
The previous prime is 101421020142149. The next prime is 101421020142217. The reversal of 101421020142198 is 891241020124101.
101421020142198 is a `hidden beast` number, since 1 + 0 + 1 + 4 + 21 + 0 + 201 + 421 + 9 + 8 = 666.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 71796078 + ... + 73195073.
It is an arithmetic number, because the mean of its divisors is an integer number (9156299992164).
Almost surely, 2101421020142198 is an apocalyptic number.
101421020142198 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
101421020142198 is an abundant number, since it is smaller than the sum of its proper divisors (118330179669738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101421020142198 is a wasteful number, since it uses less digits than its factorization.
101421020142198 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145030020 (or 145030017 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 36.
Adding to 101421020142198 its reverse (891241020124101), we get a palindrome (992662040266299).
The spelling of 101421020142198 in words is "one hundred one trillion, four hundred twenty-one billion, twenty million, one hundred forty-two thousand, one hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •