Base | Representation |
---|---|
bin | 1001010100111111100001… |
… | …1100110100110011010111 |
3 | 1100022111012001200022001012 |
4 | 2111033320130310303113 |
5 | 2321014302320211211 |
6 | 33451354132122435 |
7 | 2105663365064453 |
oct | 225177034646327 |
9 | 40274161608035 |
10 | 10256255241431 |
11 | 32a4720781791 |
12 | 119789316641b |
13 | 59521213c4b4 |
14 | 2765965d1663 |
15 | 12bbc6eb1d8b |
hex | 953f8734cd7 |
10256255241431 has 8 divisors (see below), whose sum is σ = 10258223485104. Its totient is φ = 10254287190400.
The previous prime is 10256255241373. The next prime is 10256255241437. The reversal of 10256255241431 is 13414255265201.
It is a happy number.
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-10256255241431 is a prime.
It is a super-3 number, since 3×102562552414313 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10256255241437) 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, 145544756 + ... + 145615206.
It is an arithmetic number, because the mean of its divisors is an integer number (1282277935638).
Almost surely, 210256255241431 is an apocalyptic number.
10256255241431 is a deficient number, since it is larger than the sum of its proper divisors (1968243673).
10256255241431 is an equidigital number, since it uses as much as digits as its factorization.
10256255241431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96321.
The product of its (nonzero) digits is 288000, while the sum is 41.
The spelling of 10256255241431 in words is "ten trillion, two hundred fifty-six billion, two hundred fifty-five million, two hundred forty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •