Base | Representation |
---|---|
bin | 10110111101111001111011… |
… | …111111111010101000011010 |
3 | 111020122120100201021110202022 |
4 | 112331321323333322220122 |
5 | 101214431234013020442 |
6 | 554455511331334442 |
7 | 30163545514536461 |
oct | 2675717377725032 |
9 | 436576321243668 |
10 | 101011121220122 |
11 | 2a204637635383 |
12 | b3b4770151422 |
13 | 444940049c4b9 |
14 | 1ad2d702819d8 |
15 | ba27e756c3d2 |
hex | 5bde7bffaa1a |
101011121220122 has 16 divisors (see below), whose sum is σ = 154071825826344. Its totient is φ = 49654612224000.
The previous prime is 101011121219959. The next prime is 101011121220173. The reversal of 101011121220122 is 221022121110101.
101011121220122 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 41180571349681 + 59830549870441 = 6417209^2 + 7735021^2 .
It is a super-2 number, since 2×1010111212201222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101011121220122.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 191305079 + ... + 191832362.
Almost surely, 2101011121220122 is an apocalyptic number.
101011121220122 is a deficient number, since it is larger than the sum of its proper divisors (53060704606222).
101011121220122 is a wasteful number, since it uses less digits than its factorization.
101011121220122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 383139665.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 101011121220122 its reverse (221022121110101), we get a palindrome (322033242330223).
The spelling of 101011121220122 in words is "one hundred one trillion, eleven billion, one hundred twenty-one million, two hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •