Base | Representation |
---|---|
bin | 110000111001101000… |
… | …1100100100011111011 |
3 | 101001001112212100101021 |
4 | 1201303101210203323 |
5 | 3210031334414042 |
6 | 120124205203311 |
7 | 10405216324201 |
oct | 1416321444373 |
9 | 331045770337 |
10 | 105013201147 |
11 | 4059923a348 |
12 | 18428860537 |
13 | 9b97310c5a |
14 | 5122b9b071 |
15 | 2ae93ec867 |
hex | 18734648fb |
105013201147 has 2 divisors, whose sum is σ = 105013201148. Its totient is φ = 105013201146.
The previous prime is 105013201129. The next prime is 105013201151. The reversal of 105013201147 is 741102310501.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105013201147 is a prime.
It is a super-2 number, since 2×1050132011472 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105013201247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52506600573 + 52506600574.
It is an arithmetic number, because the mean of its divisors is an integer number (52506600574).
Almost surely, 2105013201147 is an apocalyptic number.
105013201147 is a deficient number, since it is larger than the sum of its proper divisors (1).
105013201147 is an equidigital number, since it uses as much as digits as its factorization.
105013201147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 25.
Adding to 105013201147 its reverse (741102310501), we get a palindrome (846115511648).
The spelling of 105013201147 in words is "one hundred five billion, thirteen million, two hundred one thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •