Base | Representation |
---|---|
bin | 1001001110010010100101… |
… | …1100000111101111110001 |
3 | 1022220110222121021120202011 |
4 | 2103210221130013233301 |
5 | 2312122444413222343 |
6 | 33322432450522521 |
7 | 2064446143301065 |
oct | 223445134075761 |
9 | 38813877246664 |
10 | 10141113023473 |
11 | 325a904a18173 |
12 | 11794ba296441 |
13 | 5873c24aac93 |
14 | 270b924c9aa5 |
15 | 128bd871e29d |
hex | 93929707bf1 |
10141113023473 has 2 divisors, whose sum is σ = 10141113023474. Its totient is φ = 10141113023472.
The previous prime is 10141113023411. The next prime is 10141113023521. The reversal of 10141113023473 is 37432031114101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7221006219249 + 2920106804224 = 2687193^2 + 1708832^2 .
It is a cyclic number.
It is not a de Polignac number, because 10141113023473 - 221 = 10141110926321 is a prime.
It is not a weakly prime, because it can be changed into another prime (10141113023273) 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 as a sum of consecutive naturals, namely, 5070556511736 + 5070556511737.
It is an arithmetic number, because the mean of its divisors is an integer number (5070556511737).
Almost surely, 210141113023473 is an apocalyptic number.
It is an amenable number.
10141113023473 is a deficient number, since it is larger than the sum of its proper divisors (1).
10141113023473 is an equidigital number, since it uses as much as digits as its factorization.
10141113023473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 31.
Adding to 10141113023473 its reverse (37432031114101), we get a palindrome (47573144137574).
The spelling of 10141113023473 in words is "ten trillion, one hundred forty-one billion, one hundred thirteen million, twenty-three thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •