Base | Representation |
---|---|
bin | 111100011011010… |
… | …001110101011001 |
3 | 2121122121120001202 |
4 | 330123101311121 |
5 | 4034012041042 |
6 | 244332523545 |
7 | 34060010120 |
oct | 7433216531 |
9 | 2548546052 |
10 | 1013783897 |
11 | 480288935 |
12 | 2436205b5 |
13 | 132055139 |
14 | 988d8ab7 |
15 | 5e005632 |
hex | 3c6d1d59 |
1013783897 has 4 divisors (see below), whose sum is σ = 1158610176. Its totient is φ = 868957620.
The previous prime is 1013783887. The next prime is 1013783921. The reversal of 1013783897 is 7983873101.
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, and also an emirpimes, since its reverse is a distinct semiprime: 7983873101 = 29 ⋅275305969.
It is a cyclic number.
It is not a de Polignac number, because 1013783897 - 226 = 946675033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1013783887) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 72413129 + ... + 72413142.
It is an arithmetic number, because the mean of its divisors is an integer number (289652544).
Almost surely, 21013783897 is an apocalyptic number.
It is an amenable number.
1013783897 is a deficient number, since it is larger than the sum of its proper divisors (144826279).
1013783897 is an equidigital number, since it uses as much as digits as its factorization.
1013783897 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144826278.
The product of its (nonzero) digits is 254016, while the sum is 47.
The square root of 1013783897 is about 31839.9732568983. The cubic root of 1013783897 is about 1004.5736818758.
The spelling of 1013783897 in words is "one billion, thirteen million, seven hundred eighty-three thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •