Search a number
-
+
16361201410 = 251636120141
BaseRepresentation
bin11110011110011010…
…00001111100000010
31120020020111010222121
433033031001330002
5232001431421120
611303301154454
71116305626441
oct171715017402
946206433877
1016361201410
116a36520864
1232073bba2a
131709861a88
14b12d16d58
1565b5935aa
hex3cf341f02

16361201410 has 8 divisors (see below), whose sum is σ = 29450162556. Its totient is φ = 6544480560.

The previous prime is 16361201407. The next prime is 16361201453. The reversal of 16361201410 is 1410216361.

16361201410 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 2 ways, for example, as 14912561689 + 1448639721 = 122117^2 + 38061^2 .

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

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 3 ways as a sum of consecutive naturals, for example, 818060061 + ... + 818060080.

Almost surely, 216361201410 is an apocalyptic number.

16361201410 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 1636120148.

The product of its (nonzero) digits is 864, while the sum is 25.

Adding to 16361201410 its reverse (1410216361), we get a palindrome (17771417771).

The spelling of 16361201410 in words is "sixteen billion, three hundred sixty-one million, two hundred one thousand, four hundred ten".

Divisors: 1 2 5 10 1636120141 3272240282 8180600705 16361201410