Base | Representation |
---|---|
bin | 110000011111000100… |
… | …1111111110100110110 |
3 | 100221202102221211002110 |
4 | 1200332021333310312 |
5 | 3201220214220342 |
6 | 115455532151450 |
7 | 10344145410630 |
oct | 1407611776466 |
9 | 327672854073 |
10 | 104122023222 |
11 | 40181193168 |
12 | 1821a308586 |
13 | 9a847b5c39 |
14 | 507a699a50 |
15 | 2a96064c9c |
hex | 183e27fd36 |
104122023222 has 64 divisors (see below), whose sum is σ = 243936419328. Its totient is φ = 29007072000.
The previous prime is 104122023191. The next prime is 104122023251. The reversal of 104122023222 is 222320221401.
It is a super-2 number, since 2×1041220232222 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3188397 + ... + 3220887.
It is an arithmetic number, because the mean of its divisors is an integer number (3811506552).
Almost surely, 2104122023222 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 104122023222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (121968209664).
104122023222 is an abundant number, since it is smaller than the sum of its proper divisors (139814396106).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104122023222 is a wasteful number, since it uses less digits than its factorization.
104122023222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34405.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 104122023222 its reverse (222320221401), we get a palindrome (326442244623).
The spelling of 104122023222 in words is "one hundred four billion, one hundred twenty-two million, twenty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •