Base | Representation |
---|---|
bin | 100001001000100011… |
… | …1000010001101101011 |
3 | 20210122211211120202211 |
4 | 1002101013002031223 |
5 | 2131210412022011 |
6 | 52404313305551 |
7 | 5066156111041 |
oct | 1022107021553 |
9 | 223584746684 |
10 | 71154017131 |
11 | 281a365123a |
12 | 119594052b7 |
13 | 692c55c022 |
14 | 362ddb6391 |
15 | 1cb6ab6b21 |
hex | 10911c236b |
71154017131 has 2 divisors, whose sum is σ = 71154017132. Its totient is φ = 71154017130.
The previous prime is 71154017101. The next prime is 71154017141. The reversal of 71154017131 is 13171045117.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 71154017131 - 217 = 71153886059 is a prime.
It is a super-2 number, since 2×711540171312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 71154017093 and 71154017102.
It is not a weakly prime, because it can be changed into another prime (71154017101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 35577008565 + 35577008566.
It is an arithmetic number, because the mean of its divisors is an integer number (35577008566).
Almost surely, 271154017131 is an apocalyptic number.
71154017131 is a deficient number, since it is larger than the sum of its proper divisors (1).
71154017131 is an equidigital number, since it uses as much as digits as its factorization.
71154017131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2940, while the sum is 31.
The spelling of 71154017131 in words is "seventy-one billion, one hundred fifty-four million, seventeen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •