Base | Representation |
---|---|
bin | 11101100000011110110… |
… | …10010101010001101111 |
3 | 10120220222101212020221122 |
4 | 32300033122111101233 |
5 | 113102401413433431 |
6 | 2053433230451155 |
7 | 133151443654346 |
oct | 16601732252157 |
9 | 3526871766848 |
10 | 1013870842991 |
11 | 360a867285a6 |
12 | 1445b3363abb |
13 | 747b8bc5846 |
14 | 371006dcb5d |
15 | 1b58e385a7b |
hex | ec0f69546f |
1013870842991 has 4 divisors (see below), whose sum is σ = 1033000481592. Its totient is φ = 994741204392.
The previous prime is 1013870842949. The next prime is 1013870842993. The reversal of 1013870842991 is 1992480783101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1013870842991 - 226 = 1013803734127 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (53), and also a Moran number because the ratio is a prime number: 19129638547 = 1013870842991 / (1 + 0 + 1 + 3 + 8 + 7 + 0 + 8 + 4 + 2 + 9 + 9 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013870842993) 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, 9564819221 + ... + 9564819326.
It is an arithmetic number, because the mean of its divisors is an integer number (258250120398).
Almost surely, 21013870842991 is an apocalyptic number.
1013870842991 is a deficient number, since it is larger than the sum of its proper divisors (19129638601).
1013870842991 is an equidigital number, since it uses as much as digits as its factorization.
1013870842991 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19129638600.
The product of its (nonzero) digits is 870912, while the sum is 53.
The spelling of 1013870842991 in words is "one trillion, thirteen billion, eight hundred seventy million, eight hundred forty-two thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •