Base | Representation |
---|---|
bin | 10111000010000111000110… |
… | …011001000011001010001101 |
3 | 111021200012100101021221210222 |
4 | 113002013012121003022031 |
5 | 101234200132311201334 |
6 | 555240345510241125 |
7 | 30223456465002605 |
oct | 2702070631031215 |
9 | 437605311257728 |
10 | 101300132131469 |
11 | 2a306165776727 |
12 | b4407893561a5 |
13 | 446a73b72408b |
14 | 1b02d49b53c05 |
15 | baa0b00e4d2e |
hex | 5c21c664328d |
101300132131469 has 2 divisors, whose sum is σ = 101300132131470. Its totient is φ = 101300132131468.
The previous prime is 101300132131441. The next prime is 101300132131537. The reversal of 101300132131469 is 964131231003101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 53265737562244 + 48034394569225 = 7298338^2 + 6930685^2 .
It is a cyclic number.
It is not a de Polignac number, because 101300132131469 - 236 = 101231412654733 is a prime.
It is a super-2 number, since 2×1013001321314692 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101300132131169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50650066065734 + 50650066065735.
It is an arithmetic number, because the mean of its divisors is an integer number (50650066065735).
Almost surely, 2101300132131469 is an apocalyptic number.
It is an amenable number.
101300132131469 is a deficient number, since it is larger than the sum of its proper divisors (1).
101300132131469 is an equidigital number, since it uses as much as digits as its factorization.
101300132131469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11664, while the sum is 35.
The spelling of 101300132131469 in words is "one hundred one trillion, three hundred billion, one hundred thirty-two million, one hundred thirty-one thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •