Base | Representation |
---|---|
bin | 1001001101110010010101… |
… | …1001101110000100001111 |
3 | 1022212122122020100020012012 |
4 | 2103130211121232010033 |
5 | 2312002232032204133 |
6 | 33314441414531435 |
7 | 2064021455266121 |
oct | 223344531560417 |
9 | 38778566306165 |
10 | 10132455350543 |
11 | 3257171990379 |
12 | 11778a2966b7b |
13 | 5866429285a6 |
14 | 2705b0745211 |
15 | 12887d612b48 |
hex | 9372566e10f |
10132455350543 has 2 divisors, whose sum is σ = 10132455350544. Its totient is φ = 10132455350542.
The previous prime is 10132455350513. The next prime is 10132455350603. The reversal of 10132455350543 is 34505355423101.
10132455350543 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (34505355423101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10132455350543 - 210 = 10132455349519 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10132455350543.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10132455350513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5066227675271 + 5066227675272.
It is an arithmetic number, because the mean of its divisors is an integer number (5066227675272).
Almost surely, 210132455350543 is an apocalyptic number.
10132455350543 is a deficient number, since it is larger than the sum of its proper divisors (1).
10132455350543 is an equidigital number, since it uses as much as digits as its factorization.
10132455350543 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 540000, while the sum is 41.
The spelling of 10132455350543 in words is "ten trillion, one hundred thirty-two billion, four hundred fifty-five million, three hundred fifty thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •