Base | Representation |
---|---|
bin | 101111001010001101… |
… | …0001110101100000001 |
3 | 100200101222011221202201 |
4 | 1132110122032230001 |
5 | 3124402140323211 |
6 | 114305200313201 |
7 | 10213445041303 |
oct | 1362432165401 |
9 | 320358157681 |
10 | 101274151681 |
11 | 39a4a68911a |
12 | 17764612801 |
13 | 971c797351 |
14 | 4c8a373973 |
15 | 297b0210c1 |
hex | 179468eb01 |
101274151681 has 2 divisors, whose sum is σ = 101274151682. Its totient is φ = 101274151680.
The previous prime is 101274151669. The next prime is 101274151711. The reversal of 101274151681 is 186151472101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 90726861681 + 10547290000 = 301209^2 + 102700^2 .
It is a cyclic number.
It is not a de Polignac number, because 101274151681 - 213 = 101274143489 is a prime.
It is a super-2 number, since 2×1012741516812 (a number of 23 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 101274151681.
It is not a weakly prime, because it can be changed into another prime (101274151631) 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, 50637075840 + 50637075841.
It is an arithmetic number, because the mean of its divisors is an integer number (50637075841).
Almost surely, 2101274151681 is an apocalyptic number.
It is an amenable number.
101274151681 is a deficient number, since it is larger than the sum of its proper divisors (1).
101274151681 is an equidigital number, since it uses as much as digits as its factorization.
101274151681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13440, while the sum is 37.
The spelling of 101274151681 in words is "one hundred one billion, two hundred seventy-four million, one hundred fifty-one thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •