Base | Representation |
---|---|
bin | 1001001110001111010010… |
… | …0010111110000101001101 |
3 | 1022220101200202111010212120 |
4 | 2103203310202332011031 |
5 | 2312114140230021240 |
6 | 33322204430523153 |
7 | 2064415146452535 |
oct | 223436442760515 |
9 | 38811622433776 |
10 | 10140225626445 |
11 | 325a49a0136a2 |
12 | 11792b10664b9 |
13 | 5872b06a7b95 |
14 | 270b0a6d04c5 |
15 | 128b85881ad0 |
hex | 938f48be14d |
10140225626445 has 16 divisors (see below), whose sum is σ = 16601671724352. Its totient is φ = 5282350093440.
The previous prime is 10140225626393. The next prime is 10140225626459. The reversal of 10140225626445 is 54462652204101.
10140225626445 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 10140225626445 - 210 = 10140225625421 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10140225626397 and 10140225626406.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7860639376 + ... + 7860640665.
It is an arithmetic number, because the mean of its divisors is an integer number (1037604482772).
Almost surely, 210140225626445 is an apocalyptic number.
10140225626445 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10140225626445 is a deficient number, since it is larger than the sum of its proper divisors (6461446097907).
10140225626445 is a wasteful number, since it uses less digits than its factorization.
10140225626445 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15721280092.
The product of its (nonzero) digits is 460800, while the sum is 42.
The spelling of 10140225626445 in words is "ten trillion, one hundred forty billion, two hundred twenty-five million, six hundred twenty-six thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •