Base | Representation |
---|---|
bin | 110011010111110100… |
… | …1010011010000111100 |
3 | 101112202110110120210020 |
4 | 1212233221103100330 |
5 | 3301414140201022 |
6 | 122403014212140 |
7 | 10653600133455 |
oct | 1465751232074 |
9 | 345673416706 |
10 | 110321022012 |
11 | 42872382763 |
12 | 1946a354050 |
13 | a531b78366 |
14 | 54a7aaa12c |
15 | 2d0a3aa35c |
hex | 19afa5343c |
110321022012 has 48 divisors (see below), whose sum is σ = 260093248800. Its totient is φ = 36391991040.
The previous prime is 110321021983. The next prime is 110321022041. The reversal of 110321022012 is 210220123011.
It is an interprime number because it is at equal distance from previous prime (110321021983) and next prime (110321022041).
It is a junction number, because it is equal to n+sod(n) for n = 110321021982 and 110321022000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1033462 + ... + 1135202.
It is an arithmetic number, because the mean of its divisors is an integer number (5418609350).
Almost surely, 2110321022012 is an apocalyptic number.
110321022012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110321022012 is an abundant number, since it is smaller than the sum of its proper divisors (149772226788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110321022012 is a wasteful number, since it uses less digits than its factorization.
110321022012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102686 (or 102684 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 110321022012 its reverse (210220123011), we get a palindrome (320541145023).
The spelling of 110321022012 in words is "one hundred ten billion, three hundred twenty-one million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •