Base | Representation |
---|---|
bin | 1001001001111011000000… |
… | …0000011111010001000101 |
3 | 1022122022021010012121220121 |
4 | 2102132300000133101011 |
5 | 2304410243142330423 |
6 | 33224141255501541 |
7 | 2056151245150114 |
oct | 222366000372105 |
9 | 38568233177817 |
10 | 10066061292613 |
11 | 3230aa11a5a17 |
12 | 1166a536878b1 |
13 | 5802c1591891 |
14 | 26b2b29c7c7b |
15 | 126c9488945d |
hex | 927b001f445 |
10066061292613 has 4 divisors (see below), whose sum is σ = 10067759638560. Its totient is φ = 10064362946668.
The previous prime is 10066061292587. The next prime is 10066061292641. The reversal of 10066061292613 is 31629216066001.
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 10066061292613 - 225 = 10066027738181 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10066061292613.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10066061092613) 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, 849164083 + ... + 849175936.
It is an arithmetic number, because the mean of its divisors is an integer number (2516939909640).
Almost surely, 210066061292613 is an apocalyptic number.
It is an amenable number.
10066061292613 is a deficient number, since it is larger than the sum of its proper divisors (1698345947).
10066061292613 is an equidigital number, since it uses as much as digits as its factorization.
10066061292613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1698345946.
The product of its (nonzero) digits is 139968, while the sum is 43.
The spelling of 10066061292613 in words is "ten trillion, sixty-six billion, sixty-one million, two hundred ninety-two thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •