Search a number
-
+
1306110200332 = 22746646792869
BaseRepresentation
bin10011000000011010001…
…111000000101000001100
311121212022001202210100011
4103000122033000220030
5132344403202402312
62440004014243004
7163235425344460
oct23003217005014
94555261683304
101306110200332
11463a11181133
121911717b6464
139621cc687b2
1447304c824a0
1523e95579da7
hex1301a3c0a0c

1306110200332 has 12 divisors (see below), whose sum is σ = 2612220400720. Its totient is φ = 559761514416.

The previous prime is 1306110200323. The next prime is 1306110200333. The reversal of 1306110200332 is 2330020116031.

1306110200332 is an admirable number.

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

It is not an unprimeable number, because it can be changed into a prime (1306110200333) 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, 23323396407 + ... + 23323396462.

Almost surely, 21306110200332 is an apocalyptic number.

It is an amenable number.

1306110200332 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 648, while the sum is 22.

Adding to 1306110200332 its reverse (2330020116031), we get a palindrome (3636130316363).

The spelling of 1306110200332 in words is "one trillion, three hundred six billion, one hundred ten million, two hundred thousand, three hundred thirty-two".

Divisors: 1 2 4 7 14 28 46646792869 93293585738 186587171476 326527550083 653055100166 1306110200332