Base | Representation |
---|---|
bin | 11101011011100001111… |
… | …00000010001000011010 |
3 | 10120200010002222010101112 |
4 | 32231300330002020122 |
5 | 113031430244200442 |
6 | 2052313332420322 |
7 | 133025531013410 |
oct | 16556074021032 |
9 | 3520102863345 |
10 | 1011212100122 |
11 | 35a941960744 |
12 | 143b90a776a2 |
13 | 74484125c03 |
14 | 36d2b5692b0 |
15 | 1b485c50082 |
hex | eb70f0221a |
1011212100122 has 8 divisors (see below), whose sum is σ = 1733506457376. Its totient is φ = 433376614332.
The previous prime is 1011212100079. The next prime is 1011212100131. The reversal of 1011212100122 is 2210012121101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10112121001222 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 72229435723 = 1011212100122 / (1 + 0 + 1 + 1 + 2 + 1 + 2 + 1 + 0 + 0 + 1 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 1011212100097 and 1011212100106.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36114717848 + ... + 36114717875.
It is an arithmetic number, because the mean of its divisors is an integer number (216688307172).
Almost surely, 21011212100122 is an apocalyptic number.
1011212100122 is a deficient number, since it is larger than the sum of its proper divisors (722294357254).
1011212100122 is an equidigital number, since it uses as much as digits as its factorization.
1011212100122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72229435732.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1011212100122 its reverse (2210012121101), we get a palindrome (3221224221223).
The spelling of 1011212100122 in words is "one trillion, eleven billion, two hundred twelve million, one hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •