Base | Representation |
---|---|
bin | 1011111010110101011100… |
… | …0010101001000100001111 |
3 | 1201101212100020121021012012 |
4 | 2332231113002221010033 |
5 | 3204204332303433013 |
6 | 43512312402531435 |
7 | 2521556111001605 |
oct | 276552702510417 |
9 | 51355306537165 |
10 | 13105405530383 |
11 | 41a2a75845881 |
12 | 1577ab9966b7b |
13 | 740ab035333a |
14 | 33443ad4b875 |
15 | 17ad7d2301a8 |
hex | beb570a910f |
13105405530383 has 2 divisors, whose sum is σ = 13105405530384. Its totient is φ = 13105405530382.
The previous prime is 13105405530337. The next prime is 13105405530403. The reversal of 13105405530383 is 38303550450131.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13105405530383 - 28 = 13105405530127 is a prime.
It is a super-2 number, since 2×131054055303832 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13105405530383.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13105405530313) 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, 6552702765191 + 6552702765192.
It is an arithmetic number, because the mean of its divisors is an integer number (6552702765192).
Almost surely, 213105405530383 is an apocalyptic number.
13105405530383 is a deficient number, since it is larger than the sum of its proper divisors (1).
13105405530383 is an equidigital number, since it uses as much as digits as its factorization.
13105405530383 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324000, while the sum is 41.
The spelling of 13105405530383 in words is "thirteen trillion, one hundred five billion, four hundred five million, five hundred thirty thousand, three hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •