Base | Representation |
---|---|
bin | 11000111001111001… |
… | …10100000100100111 |
3 | 1021111211011011010120 |
4 | 30130330310010213 |
5 | 204340333341423 |
6 | 10050430253023 |
7 | 652223163126 |
oct | 143474640447 |
9 | 37454134116 |
10 | 13370605863 |
11 | 57413a409a |
12 | 2711957173 |
13 | 13510c1004 |
14 | 90ba7babd |
15 | 533c5aee3 |
hex | 31cf34127 |
13370605863 has 4 divisors (see below), whose sum is σ = 17827474488. Its totient is φ = 8913737240.
The previous prime is 13370605861. The next prime is 13370605873. The reversal of 13370605863 is 36850607331.
13370605863 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13370605863 - 21 = 13370605861 is a prime.
It is a super-2 number, since 2×133706058632 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13370605861) 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, 2228434308 + ... + 2228434313.
It is an arithmetic number, because the mean of its divisors is an integer number (4456868622).
Almost surely, 213370605863 is an apocalyptic number.
13370605863 is a deficient number, since it is larger than the sum of its proper divisors (4456868625).
13370605863 is an equidigital number, since it uses as much as digits as its factorization.
13370605863 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4456868624.
The product of its (nonzero) digits is 272160, while the sum is 42.
The spelling of 13370605863 in words is "thirteen billion, three hundred seventy million, six hundred five thousand, eight hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •