Base | Representation |
---|---|
bin | 100100000100101… |
… | …0011111010011101 |
3 | 10010100120201012221 |
4 | 1020021103322131 |
5 | 4434330303123 |
6 | 320035025341 |
7 | 41665143115 |
oct | 11011237235 |
9 | 3110521187 |
10 | 1210400413 |
11 | 57126a822 |
12 | 29943b251 |
13 | 1639c6381 |
14 | b6a7a045 |
15 | 713e225d |
hex | 48253e9d |
1210400413 has 4 divisors (see below), whose sum is σ = 1210603968. Its totient is φ = 1210196860.
The previous prime is 1210400407. The next prime is 1210400431. The reversal of 1210400413 is 3140040121.
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, and also an emirpimes, since its reverse is a distinct semiprime: 3140040121 = 59 ⋅53221019.
It is a cyclic number.
It is not a de Polignac number, because 1210400413 - 25 = 1210400381 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1210400813) 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, 92581 + ... + 104842.
It is an arithmetic number, because the mean of its divisors is an integer number (302650992).
Almost surely, 21210400413 is an apocalyptic number.
It is an amenable number.
1210400413 is a deficient number, since it is larger than the sum of its proper divisors (203555).
1210400413 is an equidigital number, since it uses as much as digits as its factorization.
1210400413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203554.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 1210400413 is about 34790.8093179794. The cubic root of 1210400413 is about 1065.7197667752.
Adding to 1210400413 its reverse (3140040121), we get a palindrome (4350440534).
The spelling of 1210400413 in words is "one billion, two hundred ten million, four hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •