Base | Representation |
---|---|
bin | 1011101101001010… |
… | …0101101000000101 |
3 | 22002222121220122222 |
4 | 2323102211220011 |
5 | 22413401241401 |
6 | 1235444302125 |
7 | 140603235140 |
oct | 27322455005 |
9 | 8088556588 |
10 | 3142212101 |
11 | 1372773506 |
12 | 7383a1945 |
13 | 3b0cb7702 |
14 | 21b465057 |
15 | 135cd5c1b |
hex | bb4a5a05 |
3142212101 has 8 divisors (see below), whose sum is σ = 3591440064. Its totient is φ = 2693069280.
The previous prime is 3142212071. The next prime is 3142212103. The reversal of 3142212101 is 1012122413.
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 3142212101 - 218 = 3141949957 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 3142212101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3142212103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 123266 + ... + 146556.
It is an arithmetic number, because the mean of its divisors is an integer number (448930008).
Almost surely, 23142212101 is an apocalyptic number.
It is an amenable number.
3142212101 is a deficient number, since it is larger than the sum of its proper divisors (449227963).
3142212101 is a wasteful number, since it uses less digits than its factorization.
3142212101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42571.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 3142212101 is about 56055.4377469305. The cubic root of 3142212101 is about 1464.6881421400.
Adding to 3142212101 its reverse (1012122413), we get a palindrome (4154334514).
The spelling of 3142212101 in words is "three billion, one hundred forty-two million, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •