Base | Representation |
---|---|
bin | 1000101110111001… |
… | …1101011110110001 |
3 | 20001101001022212112 |
4 | 2023232131132301 |
5 | 14300104244101 |
6 | 1024340335105 |
7 | 112043322326 |
oct | 21356353661 |
9 | 6041038775 |
10 | 2344212401 |
11 | aa3279523 |
12 | 5550a4495 |
13 | 2b488513b |
14 | 18349ab4d |
15 | dac066bb |
hex | 8bb9d7b1 |
2344212401 has 4 divisors (see below), whose sum is σ = 2349807600. Its totient is φ = 2338617204.
The previous prime is 2344212379. The next prime is 2344212413. The reversal of 2344212401 is 1042124432.
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 a de Polignac number, because none of the positive numbers 2k-2344212401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2344212421) 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 3 ways as a sum of consecutive naturals, for example, 2796971 + ... + 2797808.
It is an arithmetic number, because the mean of its divisors is an integer number (587451900).
Almost surely, 22344212401 is an apocalyptic number.
It is an amenable number.
2344212401 is a deficient number, since it is larger than the sum of its proper divisors (5595199).
2344212401 is an equidigital number, since it uses as much as digits as its factorization.
2344212401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5595198.
The product of its (nonzero) digits is 1536, while the sum is 23.
The square root of 2344212401 is about 48417.0672490600. The cubic root of 2344212401 is about 1328.4105611803.
Adding to 2344212401 its reverse (1042124432), we get a palindrome (3386336833).
The spelling of 2344212401 in words is "two billion, three hundred forty-four million, two hundred twelve thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •