Base | Representation |
---|---|
bin | 1011010101110010… |
… | …1111110110010001 |
3 | 21212011012222221210 |
4 | 2311130233312101 |
5 | 22213304241423 |
6 | 1222024010333 |
7 | 135303242655 |
oct | 26534576621 |
9 | 7764188853 |
10 | 3044212113 |
11 | 1322418688 |
12 | 70b6009a9 |
13 | 3968c4357 |
14 | 20c434a65 |
15 | 12c3c8b93 |
hex | b572fd91 |
3044212113 has 8 divisors (see below), whose sum is σ = 4074383808. Its totient is φ = 2021757584.
The previous prime is 3044212103. The next prime is 3044212141. The reversal of 3044212113 is 3112124403.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3044212113 - 24 = 3044212097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3044212113.
It is not an unprimeable number, because it can be changed into a prime (3044212103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1928370 + ... + 1929947.
It is an arithmetic number, because the mean of its divisors is an integer number (509297976).
Almost surely, 23044212113 is an apocalyptic number.
It is an amenable number.
3044212113 is a deficient number, since it is larger than the sum of its proper divisors (1030171695).
3044212113 is a wasteful number, since it uses less digits than its factorization.
3044212113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3858583.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 3044212113 is about 55174.3791356097. The cubic root of 3044212113 is about 1449.3000367922.
Adding to 3044212113 its reverse (3112124403), we get a palindrome (6156336516).
The spelling of 3044212113 in words is "three billion, forty-four million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •