Base | Representation |
---|---|
bin | 1000101100011110… |
… | …0010110000110101 |
3 | 20000122212000101102 |
4 | 2023013202300311 |
5 | 14240001313141 |
6 | 1023333535445 |
7 | 111560522051 |
oct | 21307426065 |
9 | 6018760342 |
10 | 2334010421 |
11 | a98540636 |
12 | 5517a4585 |
13 | 2b2722672 |
14 | 181da2c61 |
15 | d9d8d99b |
hex | 8b1e2c35 |
2334010421 has 4 divisors (see below), whose sum is σ = 2341062144. Its totient is φ = 2326958700.
The previous prime is 2334010417. The next prime is 2334010433. The reversal of 2334010421 is 1240104332.
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 2334010421 - 22 = 2334010417 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2334010393 and 2334010402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2334030421) 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, 3525365 + ... + 3526026.
It is an arithmetic number, because the mean of its divisors is an integer number (585265536).
Almost surely, 22334010421 is an apocalyptic number.
It is an amenable number.
2334010421 is a deficient number, since it is larger than the sum of its proper divisors (7051723).
2334010421 is an equidigital number, since it uses as much as digits as its factorization.
2334010421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7051722.
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 2334010421 is about 48311.5971687958. The cubic root of 2334010421 is about 1326.4806840609.
Adding to 2334010421 its reverse (1240104332), we get a palindrome (3574114753).
The spelling of 2334010421 in words is "two billion, three hundred thirty-four million, ten thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •