Search a number
-
+
101010023013 = 3232575696161
BaseRepresentation
bin101111000010010101…
…0101010001001100101
3100122201120011211100110
41132010222222021211
53123332031214023
6114223043203233
710204060013004
oct1360452521145
9318646154313
10101010023013
1139924585369
12176b0076519
1396a9b48ab3
144c6325ac3b
152962c4aa93
hex1784aaa265

101010023013 has 16 divisors (see below), whose sum is σ = 141082540416. Its totient is φ = 64161546240.

The previous prime is 101010022991. The next prime is 101010023033. The reversal of 101010023013 is 310320010101.

It is not a de Polignac number, because 101010023013 - 29 = 101010022501 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 101010023013.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (101010023033) 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 in 15 ways as a sum of consecutive naturals, for example, 2830348 + ... + 2865813.

It is an arithmetic number, because the mean of its divisors is an integer number (8817658776).

Almost surely, 2101010023013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5696444.

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

Adding to 101010023013 its reverse (310320010101), we get a palindrome (411330033114).

The spelling of 101010023013 in words is "one hundred one billion, ten million, twenty-three thousand, thirteen".

Divisors: 1 3 23 69 257 771 5911 17733 5696161 17088483 131011703 393035109 1463913377 4391740131 33670007671 101010023013