Base | Representation |
---|---|
bin | 1011101101101000… |
… | …1011011100110001 |
3 | 22010010101000100011 |
4 | 2323122023130301 |
5 | 22414403431113 |
6 | 1235555054521 |
7 | 140626163530 |
oct | 27332133461 |
9 | 8103330304 |
10 | 3144202033 |
11 | 1373902585 |
12 | 738ba1441 |
13 | 3b153339b |
14 | 21b822317 |
15 | 13607a63d |
hex | bb68b731 |
3144202033 has 4 divisors (see below), whose sum is σ = 3593373760. Its totient is φ = 2695030308.
The previous prime is 3144202031. The next prime is 3144202043. The reversal of 3144202033 is 3302024413.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3144202033 - 21 = 3144202031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3144201995 and 3144202013.
It is not an unprimeable number, because it can be changed into a prime (3144202031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 224585853 + ... + 224585866.
It is an arithmetic number, because the mean of its divisors is an integer number (898343440).
Almost surely, 23144202033 is an apocalyptic number.
It is an amenable number.
3144202033 is a deficient number, since it is larger than the sum of its proper divisors (449171727).
3144202033 is an equidigital number, since it uses as much as digits as its factorization.
3144202033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 449171726.
The product of its (nonzero) digits is 1728, while the sum is 22.
The square root of 3144202033 is about 56073.1846161782. The cubic root of 3144202033 is about 1464.9972677557.
Adding to 3144202033 its reverse (3302024413), we get a palindrome (6446226446).
The spelling of 3144202033 in words is "three billion, one hundred forty-four million, two hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •