Base | Representation |
---|---|
bin | 1100000100110011… |
… | …1101111100001011 |
3 | 22100220021021210111 |
4 | 3001030331330023 |
5 | 23114244331443 |
6 | 1253350255151 |
7 | 143216314651 |
oct | 30114757413 |
9 | 8326237714 |
10 | 3241402123 |
11 | 1413761433 |
12 | 7656574b7 |
13 | 3c870662b |
14 | 22a6c4dd1 |
15 | 13e87a69d |
hex | c133df0b |
3241402123 has 4 divisors (see below), whose sum is σ = 3353174640. Its totient is φ = 3129629608.
The previous prime is 3241402081. The next prime is 3241402183. The reversal of 3241402123 is 3212041423.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3241402123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3241402094 and 3241402103.
It is not an unprimeable number, because it can be changed into a prime (3241402183) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 55886215 + ... + 55886272.
It is an arithmetic number, because the mean of its divisors is an integer number (838293660).
Almost surely, 23241402123 is an apocalyptic number.
3241402123 is a deficient number, since it is larger than the sum of its proper divisors (111772517).
3241402123 is a wasteful number, since it uses less digits than its factorization.
3241402123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111772516.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 3241402123 is about 56933.3129459370. The cubic root of 3241402123 is about 1479.9406664489.
Adding to 3241402123 its reverse (3212041423), we get a palindrome (6453443546).
The spelling of 3241402123 in words is "three billion, two hundred forty-one million, four hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •