Base | Representation |
---|---|
bin | 1001010100111110111100… |
… | …1110111101111111100001 |
3 | 1100022110210021201102020111 |
4 | 2111033233032331333201 |
5 | 2321013443224122423 |
6 | 33451330530011321 |
7 | 2105656506553114 |
oct | 225175716757741 |
9 | 40273707642214 |
10 | 10256100614113 |
11 | 32a4651469a12 |
12 | 119784b416b41 |
13 | 5951b90b0343 |
14 | 27657dc6057b |
15 | 12bbb861b60d |
hex | 953ef3bdfe1 |
10256100614113 has 8 divisors (see below), whose sum is σ = 10261190495232. Its totient is φ = 10251011138496.
The previous prime is 10256100614107. The next prime is 10256100614117. The reversal of 10256100614113 is 31141600165201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10256100614113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10256100614117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 58921656 + ... + 59095462.
It is an arithmetic number, because the mean of its divisors is an integer number (1282648811904).
Almost surely, 210256100614113 is an apocalyptic number.
It is an amenable number.
10256100614113 is a deficient number, since it is larger than the sum of its proper divisors (5089881119).
10256100614113 is a wasteful number, since it uses less digits than its factorization.
10256100614113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202751.
The product of its (nonzero) digits is 4320, while the sum is 31.
Adding to 10256100614113 its reverse (31141600165201), we get a palindrome (41397700779314).
The spelling of 10256100614113 in words is "ten trillion, two hundred fifty-six billion, one hundred million, six hundred fourteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •