Base | Representation |
---|---|
bin | 10110111111100010001010… |
… | …010010111010011111101111 |
3 | 111021001021012211211020202211 |
4 | 112333202022102322133233 |
5 | 101223244431214343043 |
6 | 555023140114031251 |
7 | 30204616646456413 |
oct | 2677421222723757 |
9 | 437037184736684 |
10 | 101123030231023 |
11 | 2a248044325649 |
12 | b4123a2278527 |
13 | 4456b26336548 |
14 | 1ad8548bd6d43 |
15 | ba5697052a9d |
hex | 5bf88a4ba7ef |
101123030231023 has 2 divisors, whose sum is σ = 101123030231024. Its totient is φ = 101123030231022.
The previous prime is 101123030230987. The next prime is 101123030231063. The reversal of 101123030231023 is 320132030321101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101123030231023 - 213 = 101123030222831 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101123030230985 and 101123030231003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101123030231063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50561515115511 + 50561515115512.
It is an arithmetic number, because the mean of its divisors is an integer number (50561515115512).
Almost surely, 2101123030231023 is an apocalyptic number.
101123030231023 is a deficient number, since it is larger than the sum of its proper divisors (1).
101123030231023 is an equidigital number, since it uses as much as digits as its factorization.
101123030231023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 101123030231023 its reverse (320132030321101), we get a palindrome (421255060552124).
The spelling of 101123030231023 in words is "one hundred one trillion, one hundred twenty-three billion, thirty million, two hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •