Base | Representation |
---|---|
bin | 1001001101111011110000… |
… | …1010100111100001000001 |
3 | 1022212220011111212002112212 |
4 | 2103132330022213201001 |
5 | 2312022422044014134 |
6 | 33315540412431505 |
7 | 2064141240656015 |
oct | 223367412474101 |
9 | 38786144762485 |
10 | 10134984751169 |
11 | 325824a745513 |
12 | 1178289a78595 |
13 | 58695697cc55 |
14 | 27077064a545 |
15 | 12897a6e9bce |
hex | 937bc2a7841 |
10134984751169 has 2 divisors, whose sum is σ = 10134984751170. Its totient is φ = 10134984751168.
The previous prime is 10134984751109. The next prime is 10134984751181. The reversal of 10134984751169 is 96115748943101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6080480334769 + 4054504416400 = 2465863^2 + 2013580^2 .
It is an emirp because it is prime and its reverse (96115748943101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10134984751169 - 236 = 10066265274433 is a prime.
It is a super-2 number, since 2×101349847511692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10134984751109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5067492375584 + 5067492375585.
It is an arithmetic number, because the mean of its divisors is an integer number (5067492375585).
Almost surely, 210134984751169 is an apocalyptic number.
It is an amenable number.
10134984751169 is a deficient number, since it is larger than the sum of its proper divisors (1).
10134984751169 is an equidigital number, since it uses as much as digits as its factorization.
10134984751169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6531840, while the sum is 59.
The spelling of 10134984751169 in words is "ten trillion, one hundred thirty-four billion, nine hundred eighty-four million, seven hundred fifty-one thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •