Base | Representation |
---|---|
bin | 1001010101000000000111… |
… | …0101111100010000100001 |
3 | 1100022111121001012010220111 |
4 | 2111100001311330100201 |
5 | 2321020113140224023 |
6 | 33451421521411321 |
7 | 2106000320351626 |
oct | 225200165742041 |
9 | 40274531163814 |
10 | 10256412820513 |
11 | 32a47a1720232 |
12 | 1197917a99b41 |
13 | 595238993062 |
14 | 2765ad4d034d |
15 | 12bbd5c3c00d |
hex | 95401d7c421 |
10256412820513 has 4 divisors (see below), whose sum is σ = 10257132532528. Its totient is φ = 10255693108500.
The previous prime is 10256412820453. The next prime is 10256412820523. The reversal of 10256412820513 is 31502821465201.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10256412820513 - 229 = 10255875949601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10256412820523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 359834631 + ... + 359863132.
It is an arithmetic number, because the mean of its divisors is an integer number (2564283133132).
Almost surely, 210256412820513 is an apocalyptic number.
It is an amenable number.
10256412820513 is a deficient number, since it is larger than the sum of its proper divisors (719712015).
10256412820513 is an equidigital number, since it uses as much as digits as its factorization.
10256412820513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 719712014.
The product of its (nonzero) digits is 115200, while the sum is 40.
The spelling of 10256412820513 in words is "ten trillion, two hundred fifty-six billion, four hundred twelve million, eight hundred twenty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •