Search a number
-
+
10010011012 = 222502502753
BaseRepresentation
bin10010101001010010…
…01010010110000100
3221211121121020122121
421110221022112010
5131000030323022
64333141135324
7503025455401
oct112451122604
927747536577
1010010011012
114277432481
121b343ba544
13c36ab4051
146ad60b2a8
153d8bd92c7
hex254a4a584

10010011012 has 6 divisors (see below), whose sum is σ = 17517519278. Its totient is φ = 5005005504.

The previous prime is 10010011007. The next prime is 10010011061. The reversal of 10010011012 is 21011001001.

It can be written as a sum of positive squares in only one way, i.e., 7727464836 + 2282546176 = 87906^2 + 47776^2 .

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

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

It is an unprimeable number.

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 as a sum of consecutive naturals, namely, 1251251373 + ... + 1251251380.

Almost surely, 210010011012 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 10010011012 its reverse (21011001001), we get a palindrome (31021012013).

The spelling of 10010011012 in words is "ten billion, ten million, eleven thousand, twelve".

Divisors: 1 2 4 2502502753 5005005506 10010011012