Base | Representation |
---|---|
bin | 1001111100101110… |
… | …1001001000100101 |
3 | 20220010021000211111 |
4 | 2133023221020211 |
5 | 20432140120123 |
6 | 1121000505021 |
7 | 123115655404 |
oct | 23713511045 |
9 | 6803230744 |
10 | 2670629413 |
11 | 1150556451 |
12 | 62647b171 |
13 | 3373a20ba |
14 | 1b498963b |
15 | 1096d290d |
hex | 9f2e9225 |
2670629413 has 2 divisors, whose sum is σ = 2670629414. Its totient is φ = 2670629412.
The previous prime is 2670629393. The next prime is 2670629449. The reversal of 2670629413 is 3149260762.
It is a happy number.
2670629413 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., 1640412004 + 1030217409 = 40502^2 + 32097^2 .
It is a cyclic number.
It is not a de Polignac number, because 2670629413 - 29 = 2670628901 is a prime.
It is a super-2 number, since 2×26706294132 = 14264522923161449138, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2670629453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1335314706 + 1335314707.
It is an arithmetic number, because the mean of its divisors is an integer number (1335314707).
Almost surely, 22670629413 is an apocalyptic number.
It is an amenable number.
2670629413 is a deficient number, since it is larger than the sum of its proper divisors (1).
2670629413 is an equidigital number, since it uses as much as digits as its factorization.
2670629413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108864, while the sum is 40.
The square root of 2670629413 is about 51678.1328319822. The cubic root of 2670629413 is about 1387.4091124407.
The spelling of 2670629413 in words is "two billion, six hundred seventy million, six hundred twenty-nine thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •