Base | Representation |
---|---|
bin | 1100101010101001… |
… | …1101111001000001 |
3 | 22202221221111122221 |
4 | 3022222131321001 |
5 | 23430413130423 |
6 | 1321220331041 |
7 | 150154425532 |
oct | 31252357101 |
9 | 8687844587 |
10 | 3400130113 |
11 | 1495315096 |
12 | 7aa843a81 |
13 | 422570113 |
14 | 243802689 |
15 | 14d780e5d |
hex | caa9de41 |
3400130113 has 2 divisors, whose sum is σ = 3400130114. Its totient is φ = 3400130112.
The previous prime is 3400130093. The next prime is 3400130183. The reversal of 3400130113 is 3110310043.
3400130113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3376539664 + 23590449 = 58108^2 + 4857^2 .
It is an emirp because it is prime and its reverse (3110310043) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3400130113 - 25 = 3400130081 is a prime.
It is not a weakly prime, because it can be changed into another prime (3400130183) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1700065056 + 1700065057.
It is an arithmetic number, because the mean of its divisors is an integer number (1700065057).
Almost surely, 23400130113 is an apocalyptic number.
It is an amenable number.
3400130113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3400130113 is an equidigital number, since it uses as much as digits as its factorization.
3400130113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 3400130113 is about 58310.6346475495. The cubic root of 3400130113 is about 1503.7137773539.
Adding to 3400130113 its reverse (3110310043), we get a palindrome (6510440156).
The spelling of 3400130113 in words is "three billion, four hundred million, one hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •