Base | Representation |
---|---|
bin | 1011001110101100… |
… | …1011100010100010 |
3 | 21210002012110211111 |
4 | 2303223023202202 |
5 | 22133144103442 |
6 | 1215041533534 |
7 | 134462220040 |
oct | 26353134242 |
9 | 7702173744 |
10 | 3014441122 |
11 | 1307634260 |
12 | 7016442aa |
13 | 39069c694 |
14 | 2084c5390 |
15 | 129997b17 |
hex | b3acb8a2 |
3014441122 has 64 divisors (see below), whose sum is σ = 6051158784. Its totient is φ = 1090160640.
The previous prime is 3014441119. The next prime is 3014441123. The reversal of 3014441122 is 2211444103.
It is a happy number.
3014441122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 3014441093 and 3014441102.
It is not an unprimeable number, because it can be changed into a prime (3014441123) 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, 183228 + ... + 199000.
It is an arithmetic number, because the mean of its divisors is an integer number (94549356).
Almost surely, 23014441122 is an apocalyptic number.
3014441122 is an abundant number, since it is smaller than the sum of its proper divisors (3036717662).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3014441122 is a wasteful number, since it uses less digits than its factorization.
3014441122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15883.
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 3014441122 is about 54903.9262894741. The cubic root of 3014441122 is about 1444.5600560407.
Adding to 3014441122 its reverse (2211444103), we get a palindrome (5225885225).
The spelling of 3014441122 in words is "three billion, fourteen million, four hundred forty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •