Base | Representation |
---|---|
bin | 1001010100111111000011… |
… | …1111111000111000010010 |
3 | 1100022110212100102022122000 |
4 | 2111033300333320320102 |
5 | 2321014023313343232 |
6 | 33451333504254430 |
7 | 2105660316301266 |
oct | 225176077707022 |
9 | 40273770368560 |
10 | 10256130215442 |
11 | 32a4667147921 |
12 | 1197859311416 |
13 | 5951c2275a17 |
14 | 276583b680a6 |
15 | 12bbbb01727c |
hex | 953f0ff8e12 |
10256130215442 has 16 divisors (see below), whose sum is σ = 22791400478880. Its totient is φ = 3418710071796.
The previous prime is 10256130215431. The next prime is 10256130215449. The reversal of 10256130215442 is 24451203165201.
10256130215442 is a `hidden beast` number, since 1 + 0 + 2 + 5 + 61 + 30 + 21 + 544 + 2 = 666.
It is a super-2 number, since 2×102561302154422 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10256130215397 and 10256130215406.
It is not an unprimeable number, because it can be changed into a prime (10256130215449) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 94964168608 + ... + 94964168715.
It is an arithmetic number, because the mean of its divisors is an integer number (1424462529930).
Almost surely, 210256130215442 is an apocalyptic number.
10256130215442 is an abundant number, since it is smaller than the sum of its proper divisors (12535270263438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10256130215442 is a wasteful number, since it uses less digits than its factorization.
10256130215442 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 189928337334 (or 189928337328 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 36.
The spelling of 10256130215442 in words is "ten trillion, two hundred fifty-six billion, one hundred thirty million, two hundred fifteen thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •