Base | Representation |
---|---|
bin | 1001001101001100100101… |
… | …1010110111100110111111 |
3 | 1022211200111001001112010020 |
4 | 2103103021122313212333 |
5 | 2311321003441311221 |
6 | 33310044114343223 |
7 | 2063212403116020 |
oct | 223231132674677 |
9 | 38750431045106 |
10 | 10122322213311 |
11 | 32529420013a0 |
12 | 117593528ab13 |
13 | 5856b94946b9 |
14 | 26dccca46c47 |
15 | 128488c06ac6 |
hex | 934c96b79bf |
10122322213311 has 32 divisors (see below), whose sum is σ = 17029449013248. Its totient is φ = 5194995587040.
The previous prime is 10122322213301. The next prime is 10122322213441. The reversal of 10122322213311 is 11331222322101.
It is not a de Polignac number, because 10122322213311 - 213 = 10122322205119 is a prime.
It is a super-2 number, since 2×101223222133112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10122322213301) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 263954181 + ... + 263992526.
It is an arithmetic number, because the mean of its divisors is an integer number (532170281664).
Almost surely, 210122322213311 is an apocalyptic number.
10122322213311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10122322213311 is a deficient number, since it is larger than the sum of its proper divisors (6907126799937).
10122322213311 is a wasteful number, since it uses less digits than its factorization.
10122322213311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 527946811.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 10122322213311 its reverse (11331222322101), we get a palindrome (21453544535412).
The spelling of 10122322213311 in words is "ten trillion, one hundred twenty-two billion, three hundred twenty-two million, two hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •