Base | Representation |
---|---|
bin | 110011010111110110… |
… | …1000111011001111101 |
3 | 101112202112100101112022 |
4 | 1212233231013121331 |
5 | 3301414414201023 |
6 | 122403051445525 |
7 | 10653611500100 |
oct | 1465755073175 |
9 | 345675311468 |
10 | 110322022013 |
11 | 428729a6005 |
12 | 1946a7568a5 |
13 | a532138588 |
14 | 54a7c8a737 |
15 | 2d0a5067c8 |
hex | 19afb4767d |
110322022013 has 12 divisors (see below), whose sum is σ = 128342562300. Its totient is φ = 94555262592.
The previous prime is 110322021991. The next prime is 110322022021. The reversal of 110322022013 is 310220223011.
It can be written as a sum of positive squares in 2 ways, for example, as 16708664644 + 93613357369 = 129262^2 + 305963^2 .
It is not a de Polignac number, because 110322022013 - 212 = 110322017917 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110322021982 and 110322022000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110322022033) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 732245 + ... + 869957.
It is an arithmetic number, because the mean of its divisors is an integer number (10695213525).
Almost surely, 2110322022013 is an apocalyptic number.
It is an amenable number.
110322022013 is a deficient number, since it is larger than the sum of its proper divisors (18020540287).
110322022013 is a wasteful number, since it uses less digits than its factorization.
110322022013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 154076 (or 154069 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 110322022013 its reverse (310220223011), we get a palindrome (420542245024).
The spelling of 110322022013 in words is "one hundred ten billion, three hundred twenty-two million, twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •