Base | Representation |
---|---|
bin | 10110111111100000010010… |
… | …100110001010101011000110 |
3 | 111021001002000220000011022021 |
4 | 112333200102212022223012 |
5 | 101223231323113341402 |
6 | 555022204534553354 |
7 | 30204516123053641 |
oct | 2677402246125306 |
9 | 437032026004267 |
10 | 101121022012102 |
11 | 2a247203784a94 |
12 | b411b2180885a |
13 | 4456896272221 |
14 | 1ad83d81dca58 |
15 | ba55caab9d37 |
hex | 5bf81298aac6 |
101121022012102 has 4 divisors (see below), whose sum is σ = 151681533018156. Its totient is φ = 50560511006050.
The previous prime is 101121022012061. The next prime is 101121022012121. The reversal of 101121022012102 is 201210220121101.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1011210220121022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25280255503024 + ... + 25280255503027.
It is an arithmetic number, because the mean of its divisors is an integer number (37920383254539).
Almost surely, 2101121022012102 is an apocalyptic number.
101121022012102 is a deficient number, since it is larger than the sum of its proper divisors (50560511006054).
101121022012102 is an equidigital number, since it uses as much as digits as its factorization.
101121022012102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50560511006053.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 101121022012102 its reverse (201210220121101), we get a palindrome (302331242133203).
The spelling of 101121022012102 in words is "one hundred one trillion, one hundred twenty-one billion, twenty-two million, twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •