Base | Representation |
---|---|
bin | 10110111101101111101011… |
… | …001001111010110001010110 |
3 | 111020121111220201012000110112 |
4 | 112331233223021322301112 |
5 | 101214241201402224342 |
6 | 554450450030323022 |
7 | 30163005443156603 |
oct | 2675575311726126 |
9 | 436544821160415 |
10 | 101000101211222 |
11 | 2a1aa9a2080604 |
12 | b3b25b5659472 |
13 | 444836538a685 |
14 | 1ad26068836aa |
15 | ba239ed79682 |
hex | 5bdbeb27ac56 |
101000101211222 has 12 divisors (see below), whose sum is σ = 158373504641940. Its totient is φ = 48304396230948.
The previous prime is 101000101211209. The next prime is 101000101211293. The reversal of 101000101211222 is 222112101000101.
It is a super-2 number, since 2×1010001012112222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101000101211197 and 101000101211206.
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 47731615772 + ... + 47731617887.
It is an arithmetic number, because the mean of its divisors is an integer number (13197792053495).
Almost surely, 2101000101211222 is an apocalyptic number.
101000101211222 is a deficient number, since it is larger than the sum of its proper divisors (57373403430718).
101000101211222 is an equidigital number, since it uses as much as digits as its factorization.
101000101211222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95463233707 (or 95463233684 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101000101211222 its reverse (222112101000101), we get a palindrome (323112202211323).
The spelling of 101000101211222 in words is "one hundred one trillion, one hundred one million, two hundred eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •