Base | Representation |
---|---|
bin | 110011010001111001… |
… | …0000110001001110100 |
3 | 101112020120222021022002 |
4 | 1212203302012021310 |
5 | 3301012213013022 |
6 | 122331144354432 |
7 | 10645632364352 |
oct | 1464362061164 |
9 | 345216867262 |
10 | 110122001012 |
11 | 4277aaa92a1 |
12 | 19413775a18 |
13 | a4cc87485a |
14 | 54894a07d2 |
15 | 2ce7b96092 |
hex | 19a3c86274 |
110122001012 has 24 divisors (see below), whose sum is σ = 196527076200. Its totient is φ = 53973286016.
The previous prime is 110122000999. The next prime is 110122001027. The reversal of 110122001012 is 210100221011.
It can be written as a sum of positive squares in 4 ways, for example, as 1429142416 + 108692858596 = 37804^2 + 329686^2 .
It is a junction number, because it is equal to n+sod(n) for n = 110122000984 and 110122001002.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 914 + ... + 469302.
It is an arithmetic number, because the mean of its divisors is an integer number (8188628175).
Almost surely, 2110122001012 is an apocalyptic number.
It is an amenable number.
110122001012 is a deficient number, since it is larger than the sum of its proper divisors (86405075188).
110122001012 is a wasteful number, since it uses less digits than its factorization.
110122001012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469555 (or 469553 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110122001012 its reverse (210100221011), we get a palindrome (320222222023).
The spelling of 110122001012 in words is "one hundred ten billion, one hundred twenty-two million, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •