Base | Representation |
---|---|
bin | 11101011110111110101… |
… | …10000111100111110001 |
3 | 10120211220012110100012002 |
4 | 32233133112013213301 |
5 | 113044223443311423 |
6 | 2053221222343345 |
7 | 133122452410256 |
oct | 16573726074761 |
9 | 3524805410162 |
10 | 1013064432113 |
11 | 360702509128 |
12 | 14440928ab55 |
13 | 746bab09946 |
14 | 3706558542d |
15 | 1b543694228 |
hex | ebdf5879f1 |
1013064432113 has 4 divisors (see below), whose sum is σ = 1013272159860. Its totient is φ = 1012856704368.
The previous prime is 1013064432053. The next prime is 1013064432137. The reversal of 1013064432113 is 3112344603101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 250153023409 + 762911408704 = 500153^2 + 873448^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013064432113 - 218 = 1013064169969 is a prime.
It is a super-2 number, since 2×10130644321132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1013064432013) 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, 103856558 + ... + 103866311.
It is an arithmetic number, because the mean of its divisors is an integer number (253318039965).
Almost surely, 21013064432113 is an apocalyptic number.
It is an amenable number.
1013064432113 is a deficient number, since it is larger than the sum of its proper divisors (207727747).
1013064432113 is an equidigital number, since it uses as much as digits as its factorization.
1013064432113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 207727746.
The product of its (nonzero) digits is 5184, while the sum is 29.
The spelling of 1013064432113 in words is "one trillion, thirteen billion, sixty-four million, four hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •