Base | Representation |
---|---|
bin | 101101110000010001100… |
… | …101000110101110111100 |
3 | 102010120202110201010120121 |
4 | 231300101211012232330 |
5 | 403003321004002002 |
6 | 10404233001424324 |
7 | 443106323351050 |
oct | 55602145065674 |
9 | 12116673633517 |
10 | 3144211000252 |
11 | 10024a815a713 |
12 | 429451a9b0a4 |
13 | 19a66194c80a |
14 | ac2758c1c60 |
15 | 56bc4eb9237 |
hex | 2dc11946bbc |
3144211000252 has 48 divisors (see below), whose sum is σ = 6385908275712. Its totient is φ = 1326739913280.
The previous prime is 3144211000243. The next prime is 3144211000261. The reversal of 3144211000252 is 2520001124413.
3144211000252 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (3144211000243) and next prime (3144211000261).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1627824 + ... + 2989687.
It is an arithmetic number, because the mean of its divisors is an integer number (133039755744).
Almost surely, 23144211000252 is an apocalyptic number.
It is an amenable number.
3144211000252 is an abundant number, since it is smaller than the sum of its proper divisors (3241697275460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3144211000252 is a wasteful number, since it uses less digits than its factorization.
3144211000252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4617898 (or 4617896 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 25.
Adding to 3144211000252 its reverse (2520001124413), we get a palindrome (5664212124665).
The spelling of 3144211000252 in words is "three trillion, one hundred forty-four billion, two hundred eleven million, two hundred fifty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •