Base | Representation |
---|---|
bin | 1001001110001111011011… |
… | …1001010000001111011111 |
3 | 1022220101210111121200000011 |
4 | 2103203312321100033133 |
5 | 2312114230321204211 |
6 | 33322212355144051 |
7 | 2064416135353615 |
oct | 223436671201737 |
9 | 38811714550004 |
10 | 10140265022431 |
11 | 325a50a281465 |
12 | 11793022a5027 |
13 | 5872b88bc80b |
14 | 270b11a276b5 |
15 | 128b89064921 |
hex | 938f6e503df |
10140265022431 has 4 divisors (see below), whose sum is σ = 10140279192000. Its totient is φ = 10140250852864.
The previous prime is 10140265022383. The next prime is 10140265022441. The reversal of 10140265022431 is 13422056204101.
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 10140265022431 - 225 = 10140231467999 is a prime.
It is a super-2 number, since 2×101402650224312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10140265022393 and 10140265022402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10140265022441) 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, 5950831 + ... + 7462768.
It is an arithmetic number, because the mean of its divisors is an integer number (2535069798000).
Almost surely, 210140265022431 is an apocalyptic number.
10140265022431 is a deficient number, since it is larger than the sum of its proper divisors (14169569).
10140265022431 is an equidigital number, since it uses as much as digits as its factorization.
10140265022431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14169568.
The product of its (nonzero) digits is 11520, while the sum is 31.
The spelling of 10140265022431 in words is "ten trillion, one hundred forty billion, two hundred sixty-five million, twenty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •