Base | Representation |
---|---|
bin | 10110111111100010010110… |
… | …010001111110110001010101 |
3 | 111021001021201212012021100202 |
4 | 112333202112101332301111 |
5 | 101223300334204003411 |
6 | 555023212055550245 |
7 | 30204624640601243 |
oct | 2677422621766125 |
9 | 437037655167322 |
10 | 101123231312981 |
11 | 2a248137887489 |
12 | b41243968b385 |
13 | 4456b58bac157 |
14 | 1ad85677bb793 |
15 | ba56a9a2283b |
hex | 5bf89647ec55 |
101123231312981 has 2 divisors, whose sum is σ = 101123231312982. Its totient is φ = 101123231312980.
The previous prime is 101123231312947. The next prime is 101123231313053. The reversal of 101123231312981 is 189213132321101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98512890233956 + 2610341079025 = 9925366^2 + 1615655^2 .
It is a cyclic number.
It is not a de Polignac number, because 101123231312981 - 218 = 101123231050837 is a prime.
It is a super-2 number, since 2×1011232313129812 (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 (101123231312881) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50561615656490 + 50561615656491.
It is an arithmetic number, because the mean of its divisors is an integer number (50561615656491).
Almost surely, 2101123231312981 is an apocalyptic number.
It is an amenable number.
101123231312981 is a deficient number, since it is larger than the sum of its proper divisors (1).
101123231312981 is an equidigital number, since it uses as much as digits as its factorization.
101123231312981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 38.
The spelling of 101123231312981 in words is "one hundred one trillion, one hundred twenty-three billion, two hundred thirty-one million, three hundred twelve thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •