Base | Representation |
---|---|
bin | 10111100000110000110001… |
… | …101110010101000010100111 |
3 | 111120010120011110200000221022 |
4 | 113200300301232111002213 |
5 | 102023202421003100022 |
6 | 1003532135225241355 |
7 | 30531604434452351 |
oct | 2740606156250247 |
9 | 446116143600838 |
10 | 103406466846887 |
11 | 2aa48488809006 |
12 | b720a4863325b |
13 | 4591259cc7aa9 |
14 | 1b76c84ac20d1 |
15 | be4c8d50ec42 |
hex | 5e0c31b950a7 |
103406466846887 has 4 divisors (see below), whose sum is σ = 107902400188080. Its totient is φ = 98910533505696.
The previous prime is 103406466846883. The next prime is 103406466846911. The reversal of 103406466846887 is 788648664604301.
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 103406466846887 - 22 = 103406466846883 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 103406466846887.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103406466846883) 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, 2247966670562 + ... + 2247966670607.
It is an arithmetic number, because the mean of its divisors is an integer number (26975600047020).
Almost surely, 2103406466846887 is an apocalyptic number.
103406466846887 is a deficient number, since it is larger than the sum of its proper divisors (4495933341193).
103406466846887 is an equidigital number, since it uses as much as digits as its factorization.
103406466846887 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4495933341192.
The product of its (nonzero) digits is 891813888, while the sum is 71.
The spelling of 103406466846887 in words is "one hundred three trillion, four hundred six billion, four hundred sixty-six million, eight hundred forty-six thousand, eight hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •