Search a number
-
+
1001020101002 = 271103921413169
BaseRepresentation
bin11101001000100010111…
…00101001000110001010
310112200210210220220222122
432210101130221012022
5112400042121213002
62043510130451242
7132215132316305
oct16442134510612
93480723826878
101001020101002
11356591828979
12142007733b22
137351b7230bc
1436641b07b3c
151b08b0b86a2
hexe91172918a

1001020101002 has 32 divisors (see below), whose sum is σ = 1525337049600. Its totient is φ = 492599923200.

The previous prime is 1001020100999. The next prime is 1001020101013. The reversal of 1001020101002 is 2001010201001.

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

It is an unprimeable number.

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, 315877274 + ... + 315880442.

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

Almost surely, 21001020101002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 6422.

The product of its (nonzero) digits is 4, while the sum is 8.

Adding to 1001020101002 its reverse (2001010201001), we get a palindrome (3002030302003).

Subtracting 1001020101002 from its reverse (2001010201001), we obtain a palindrome (999990099999).

The spelling of 1001020101002 in words is "one trillion, one billion, twenty million, one hundred one thousand, two".

Divisors: 1 2 71 142 1039 2078 2141 3169 4282 6338 73769 147538 152011 224999 304022 449998 2224499 3292591 4448998 6585182 6784829 13569658 157939429 233773961 315878858 467547922 481722859 963445718 7049437331 14098874662 500510050501 1001020101002