Base | Representation |
---|---|
bin | 1011010000101111… |
… | …1111001001100010 |
3 | 21210200101101211000 |
4 | 2310023333021202 |
5 | 22142344303442 |
6 | 1215550132430 |
7 | 134625265653 |
oct | 26413771142 |
9 | 7720341730 |
10 | 3023041122 |
11 | 13114785a2 |
12 | 7044b1116 |
13 | 3923c0c3a |
14 | 2096c352a |
15 | 12a5e5d4c |
hex | b42ff262 |
3023041122 has 32 divisors (see below), whose sum is σ = 6722760960. Its totient is φ = 1006946640.
The previous prime is 3023041117. The next prime is 3023041157. The reversal of 3023041122 is 2211403203.
3023041122 is a `hidden beast` number, since 3 + 0 + 230 + 411 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 3023041095 and 3023041104.
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 15 ways as a sum of consecutive naturals, for example, 57172 + ... + 96512.
It is an arithmetic number, because the mean of its divisors is an integer number (210086280).
Almost surely, 23023041122 is an apocalyptic number.
3023041122 is an abundant number, since it is smaller than the sum of its proper divisors (3699719838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3023041122 is a wasteful number, since it uses less digits than its factorization.
3023041122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40775 (or 40769 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 3023041122 is about 54982.1891343006. The cubic root of 3023041122 is about 1445.9324962892.
Adding to 3023041122 its reverse (2211403203), we get a palindrome (5234444325).
The spelling of 3023041122 in words is "three billion, twenty-three million, forty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •