Search a number
BaseRepresentation
bin101111000010010101…
…0100111001101111010
3100122201120011012212121
41132010222213031322
53123332030323002
6114223043031454
710204056632665
oct1360452471572
9318646135777
10101010011002
113992457733a
12176b006b58a
1396a9b434a4
144c632566dc
152962c47237
hex1784aa737a

101010011002 has 8 divisors (see below), whose sum is σ = 151519413312. Its totient is φ = 50503539900.

The previous prime is 101010010999. The next prime is 101010011009. The reversal of 101010011002 is 200110010101.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a super-2 number, since 2×1010100110022 (a number of 23 digits) contains 22 as substring.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 644524 + ... + 785767.

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

Almost surely, 2101010011002 is an apocalyptic number.

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

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

101010011002 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 1465604.

The product of its (nonzero) digits is 2, while the sum is 7.

Adding to 101010011002 its reverse (200110010101), we get a palindrome (301120021103).

Subtracting 101010011002 from its reverse (200110010101), we obtain a palindrome (99099999099).

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