Base | Representation |
---|---|
bin | 1001010100111100000000… |
… | …1011010101011011111110 |
3 | 1100022101202021011120221120 |
4 | 2111033000023111123332 |
5 | 2321010334122214124 |
6 | 33451120324411410 |
7 | 2105631112225155 |
oct | 225170013253376 |
9 | 40271667146846 |
10 | 10255311132414 |
11 | 32a42868626a7 |
12 | 119766ab46b66 |
13 | 5950c1670bca |
14 | 27650707259c |
15 | 12bb6e170d79 |
hex | 953c02d56fe |
10255311132414 has 16 divisors (see below), whose sum is σ = 20586869934480. Its totient is φ = 3405729099200.
The previous prime is 10255311132413. The next prime is 10255311132421. The reversal of 10255311132414 is 41423111355201.
It is a super-2 number, since 2×102553111324142 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10255311132413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3176984487 + ... + 3176987714.
It is an arithmetic number, because the mean of its divisors is an integer number (1286679370905).
Almost surely, 210255311132414 is an apocalyptic number.
10255311132414 is an abundant number, since it is smaller than the sum of its proper divisors (10331558802066).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10255311132414 is a wasteful number, since it uses less digits than its factorization.
10255311132414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6353972475.
The product of its (nonzero) digits is 14400, while the sum is 33.
Adding to 10255311132414 its reverse (41423111355201), we get a palindrome (51678422487615).
The spelling of 10255311132414 in words is "ten trillion, two hundred fifty-five billion, three hundred eleven million, one hundred thirty-two thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •