Base | Representation |
---|---|
bin | 1001001100101011110100… |
… | …0110000101100111000011 |
3 | 1022210211202222111102010101 |
4 | 2103022331012011213003 |
5 | 2311200000012120301 |
6 | 33302031154343231 |
7 | 2062451406250345 |
oct | 223127506054703 |
9 | 38724688442111 |
10 | 10113525504451 |
11 | 324a138540876 |
12 | 117409b28ab17 |
13 | 584916b81725 |
14 | 26d6d662d295 |
15 | 1281217d4701 |
hex | 932bd1859c3 |
10113525504451 has 2 divisors, whose sum is σ = 10113525504452. Its totient is φ = 10113525504450.
The previous prime is 10113525504431. The next prime is 10113525504463. The reversal of 10113525504451 is 15440552531101.
It is a strong prime.
It is an emirp because it is prime and its reverse (15440552531101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10113525504451 - 227 = 10113391286723 is a prime.
It is a super-3 number, since 3×101135255044513 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 10113525504451.
It is not a weakly prime, because it can be changed into another prime (10113525504421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5056762752225 + 5056762752226.
It is an arithmetic number, because the mean of its divisors is an integer number (5056762752226).
Almost surely, 210113525504451 is an apocalyptic number.
10113525504451 is a deficient number, since it is larger than the sum of its proper divisors (1).
10113525504451 is an equidigital number, since it uses as much as digits as its factorization.
10113525504451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60000, while the sum is 37.
The spelling of 10113525504451 in words is "ten trillion, one hundred thirteen billion, five hundred twenty-five million, five hundred four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •