Base | Representation |
---|---|
bin | 1001001110001110101001… |
… | …1100101111101100000001 |
3 | 1022220101020221201112022002 |
4 | 2103203222130233230001 |
5 | 2312113313343104330 |
6 | 33322135535553345 |
7 | 2064411021525431 |
oct | 223435234575401 |
9 | 38811227645262 |
10 | 10140056222465 |
11 | 325a412428a04 |
12 | 117926438b855 |
13 | 587284573c40 |
14 | 270ad1dd42c1 |
15 | 128b75a6ce45 |
hex | 938ea72fb01 |
10140056222465 has 16 divisors (see below), whose sum is σ = 13190854607616. Its totient is φ = 7438451832000.
The previous prime is 10140056222459. The next prime is 10140056222467. The reversal of 10140056222465 is 56422265004101.
10140056222465 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10140056222465 - 24 = 10140056222449 is a prime.
It is a Smith number, since the sum of its digits (38) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10140056222467) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 516549341 + ... + 516568970.
It is an arithmetic number, because the mean of its divisors is an integer number (824428412976).
Almost surely, 210140056222465 is an apocalyptic number.
It is an amenable number.
10140056222465 is a deficient number, since it is larger than the sum of its proper divisors (3050798385151).
10140056222465 is a wasteful number, since it uses less digits than its factorization.
10140056222465 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1033118480.
The product of its (nonzero) digits is 115200, while the sum is 38.
The spelling of 10140056222465 in words is "ten trillion, one hundred forty billion, fifty-six million, two hundred twenty-two thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.338 sec. • engine limits •