Base | Representation |
---|---|
bin | 1001111100101001… |
… | …1011101001001101 |
3 | 20220002122220102221 |
4 | 2133022123221031 |
5 | 20432044441023 |
6 | 1120550015341 |
7 | 123113164135 |
oct | 23712335115 |
9 | 6802586387 |
10 | 2670312013 |
11 | 1150359a36 |
12 | 626347551 |
13 | 3372c07a5 |
14 | 1b4905ac5 |
15 | 10966d85d |
hex | 9f29ba4d |
2670312013 has 4 divisors (see below), whose sum is σ = 2670716160. Its totient is φ = 2669907868.
The previous prime is 2670312011. The next prime is 2670312017. The reversal of 2670312013 is 3102130762.
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 2670312013 - 21 = 2670312011 is a prime.
It is a super-2 number, since 2×26703120132 = 14261132493544224338, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2670312011) 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, 191995 + ... + 205432.
It is an arithmetic number, because the mean of its divisors is an integer number (667679040).
Almost surely, 22670312013 is an apocalyptic number.
It is an amenable number.
2670312013 is a deficient number, since it is larger than the sum of its proper divisors (404147).
2670312013 is an equidigital number, since it uses as much as digits as its factorization.
2670312013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 404146.
The product of its (nonzero) digits is 1512, while the sum is 25.
The square root of 2670312013 is about 51675.0618093486. The cubic root of 2670312013 is about 1387.3541464843.
Adding to 2670312013 its reverse (3102130762), we get a palindrome (5772442775).
The spelling of 2670312013 in words is "two billion, six hundred seventy million, three hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •