Base | Representation |
---|---|
bin | 1001001011111010011111… |
… | …0011100100000000100111 |
3 | 1022202120121010012001211011 |
4 | 2102332213303210000213 |
5 | 2310440340024043212 |
6 | 33252001154523051 |
7 | 2061502303366222 |
oct | 222764763440047 |
9 | 38676533161734 |
10 | 10100283424807 |
11 | 32445627523a4 |
12 | 1171604596487 |
13 | 5835b65b1444 |
14 | 26cbdba8a5b9 |
15 | 127ae8eb54a7 |
hex | 92fa7ce4027 |
10100283424807 has 2 divisors, whose sum is σ = 10100283424808. Its totient is φ = 10100283424806.
The previous prime is 10100283424793. The next prime is 10100283424813. The reversal of 10100283424807 is 70842438200101.
10100283424807 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10100283424807 - 223 = 10100275036199 is a prime.
It is a super-2 number, since 2×101002834248072 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10100283424807.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10100283424817) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050141712403 + 5050141712404.
It is an arithmetic number, because the mean of its divisors is an integer number (5050141712404).
Almost surely, 210100283424807 is an apocalyptic number.
10100283424807 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100283424807 is an equidigital number, since it uses as much as digits as its factorization.
10100283424807 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 86016, while the sum is 40.
The spelling of 10100283424807 in words is "ten trillion, one hundred billion, two hundred eighty-three million, four hundred twenty-four thousand, eight hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •