Base | Representation |
---|---|
bin | 1001001011111001100011… |
… | …0100110111111101011111 |
3 | 1022202112221121021222022022 |
4 | 2102332120310313331133 |
5 | 2310434331210013211 |
6 | 33251520220210355 |
7 | 2061463132301234 |
oct | 222763064677537 |
9 | 38675847258268 |
10 | 10100032110431 |
11 | 324444390116a |
12 | 11715543999bb |
13 | 5835764cb703 |
14 | 26cbb654b78b |
15 | 127ad1dc1bdb |
hex | 92f98d37f5f |
10100032110431 has 4 divisors (see below), whose sum is σ = 10110904051200. Its totient is φ = 10089160169664.
The previous prime is 10100032110409. The next prime is 10100032110499. The reversal of 10100032110431 is 13401123000101.
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 10100032110431 - 230 = 10098958368607 is a prime.
It is a super-2 number, since 2×101000321104312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100032116431) 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, 5435968991 + ... + 5435970848.
It is an arithmetic number, because the mean of its divisors is an integer number (2527726012800).
Almost surely, 210100032110431 is an apocalyptic number.
10100032110431 is a deficient number, since it is larger than the sum of its proper divisors (10871940769).
10100032110431 is an equidigital number, since it uses as much as digits as its factorization.
10100032110431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10871940768.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10100032110431 its reverse (13401123000101), we get a palindrome (23501155110532).
The spelling of 10100032110431 in words is "ten trillion, one hundred billion, thirty-two million, one hundred ten thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •