Base | Representation |
---|---|
bin | 1001001000110011110101… |
… | …00000010001000011001001 |
3 | 2122010221220022000010000111 |
4 | 10210121322200101003021 |
5 | 10113204313021230411 |
6 | 110423003232234321 |
7 | 4142510610223132 |
oct | 444317240210311 |
9 | 78127808003014 |
10 | 20093912289481 |
11 | 6447864705118 |
12 | 230640269b9a1 |
13 | b29b037c78b4 |
14 | 4d679c99ac89 |
15 | 24ca4e90e721 |
hex | 12467a8110c9 |
20093912289481 has 2 divisors, whose sum is σ = 20093912289482. Its totient is φ = 20093912289480.
The previous prime is 20093912289463. The next prime is 20093912289533. The reversal of 20093912289481 is 18498221939002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19097039840256 + 996872449225 = 4370016^2 + 998435^2 .
It is a cyclic number.
It is not a de Polignac number, because 20093912289481 - 215 = 20093912256713 is a prime.
It is a super-2 number, since 2×200939122894812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20093912281481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10046956144740 + 10046956144741.
It is an arithmetic number, because the mean of its divisors is an integer number (10046956144741).
Almost surely, 220093912289481 is an apocalyptic number.
It is an amenable number.
20093912289481 is a deficient number, since it is larger than the sum of its proper divisors (1).
20093912289481 is an equidigital number, since it uses as much as digits as its factorization.
20093912289481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4478976, while the sum is 58.
The spelling of 20093912289481 in words is "twenty trillion, ninety-three billion, nine hundred twelve million, two hundred eighty-nine thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •