Base | Representation |
---|---|
bin | 1011111010100001011011… |
… | …0000101101010111001111 |
3 | 1201101100110202120202020212 |
4 | 2332220112300231113033 |
5 | 3204112331210322041 |
6 | 43510023252033035 |
7 | 2521306002526115 |
oct | 276502660552717 |
9 | 51340422522225 |
10 | 13100032120271 |
11 | 41a0768684278 |
12 | 1576a5a30277b |
13 | 740435032c25 |
14 | 33408b447ab5 |
15 | 17ab666188eb |
hex | bea16c2d5cf |
13100032120271 has 2 divisors, whose sum is σ = 13100032120272. Its totient is φ = 13100032120270.
The previous prime is 13100032120267. The next prime is 13100032120391. The reversal of 13100032120271 is 17202123000131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13100032120271 - 22 = 13100032120267 is a prime.
It is a super-2 number, since 2×131000321202712 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13100032120261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6550016060135 + 6550016060136.
It is an arithmetic number, because the mean of its divisors is an integer number (6550016060136).
Almost surely, 213100032120271 is an apocalyptic number.
13100032120271 is a deficient number, since it is larger than the sum of its proper divisors (1).
13100032120271 is an equidigital number, since it uses as much as digits as its factorization.
13100032120271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 23.
The spelling of 13100032120271 in words is "thirteen trillion, one hundred billion, thirty-two million, one hundred twenty thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •