Search a number
-
+
101000020023 = 3271603174921
BaseRepresentation
bin101111000010000010…
…0100000000000110111
3100122200212100121211100
41132010010200000313
53123322001120043
6114222044541143
710203606001530
oct1360404400067
9318625317740
10101000020023
1139919972a31
12176a88517b3
1396a7a55a76
144c61bb5687
152961e21cd3
hex1784120037

101000020023 has 12 divisors (see below), whose sum is σ = 166730191888. Its totient is φ = 57714297120.

The previous prime is 101000020021. The next prime is 101000020039. The reversal of 101000020023 is 320020000101.

It is a happy number.

It is not a de Polignac number, because 101000020023 - 21 = 101000020021 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 101000019987 and 101000020014.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (101000020021) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 801587398 + ... + 801587523.

Almost surely, 2101000020023 is an apocalyptic number.

101000020023 is a deficient number, since it is larger than the sum of its proper divisors (65730171865).

101000020023 is a wasteful number, since it uses less digits than its factorization.

101000020023 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1603174934 (or 1603174931 counting only the distinct ones).

The product of its (nonzero) digits is 12, while the sum is 9.

Adding to 101000020023 its reverse (320020000101), we get a palindrome (421020020124).

The spelling of 101000020023 in words is "one hundred one billion, twenty thousand, twenty-three".

Divisors: 1 3 7 9 21 63 1603174921 4809524763 11222224447 14428574289 33666673341 101000020023