Base | Representation |
---|---|
bin | 10110111111010110111101… |
… | …110110001011100100011010 |
3 | 111021000010012011001000122121 |
4 | 112333112331312023210122 |
5 | 101223100322103241442 |
6 | 555013431251211454 |
7 | 30204013043134501 |
oct | 2677267566134432 |
9 | 437003164030577 |
10 | 101111010212122 |
11 | 2a242a36340529 |
12 | b40bba88a6b8a |
13 | 445595bcb2b21 |
14 | 1ad7b28687838 |
15 | ba51e1b7a967 |
hex | 5bf5bdd8b91a |
101111010212122 has 64 divisors (see below), whose sum is σ = 163274940601344. Its totient is φ = 46789189242880.
The previous prime is 101111010212119. The next prime is 101111010212159. The reversal of 101111010212122 is 221212010111101.
It is a super-2 number, since 2×1011110102121222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101111010212096 and 101111010212105.
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 31 ways as a sum of consecutive naturals, for example, 1578914688 + ... + 1578978724.
It is an arithmetic number, because the mean of its divisors is an integer number (2551170946896).
Almost surely, 2101111010212122 is an apocalyptic number.
101111010212122 is a deficient number, since it is larger than the sum of its proper divisors (62163930389222).
101111010212122 is a wasteful number, since it uses less digits than its factorization.
101111010212122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65823.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 101111010212122 its reverse (221212010111101), we get a palindrome (322323020323223).
The spelling of 101111010212122 in words is "one hundred one trillion, one hundred eleven billion, ten million, two hundred twelve thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •