Search a number
-
+
101010111010011 = 3672172321793319
BaseRepresentation
bin10110111101111000111111…
…110010010001010011011011
3111020122110202022101111000000
4112331320333302101103123
5101214422201404310021
6554455223203144043
730163511500102500
oct2675707762212333
9436573668344000
10101010111010011
112a204169378595
12b3b4529975023
13444929c0c8c38
141ad2cb60374a7
15ba2788a20b26
hex5bde3fc914db

101010111010011 has 336 divisors, whose sum is σ = 194792998003200. Its totient is φ = 51923323178496.

The previous prime is 101010111010009. The next prime is 101010111010019. The reversal of 101010111010011 is 110010111010101.

It is not a de Polignac number, because 101010111010011 - 21 = 101010111010009 is a prime.

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

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

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

Almost surely, 2101010111010011 is an apocalyptic number.

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

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

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

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

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

Adding to 101010111010011 its reverse (110010111010101), we get a palindrome (211020222020112).

The spelling of 101010111010011 in words is "one hundred one trillion, ten billion, one hundred eleven million, ten thousand, eleven".