Search a number
-
+
101321553051 = 341250883371
BaseRepresentation
bin101111001011100111…
…1000011010010011011
3100200112021101012020000
41132113033003102123
53130001304144201
6114314012304043
710214561663565
oct1362717032233
9320467335200
10101321553051
1139a74414504
1217778472023
1397295529b4
144c92792335
152980285d86
hex17973c349b

101321553051 has 10 divisors (see below), whose sum is σ = 151356888012. Its totient is φ = 67547701980.

The previous prime is 101321553019. The next prime is 101321553059. The reversal of 101321553051 is 150355123101.

101321553051 is a `hidden beast` number, since 101 + 3 + 2 + 1 + 553 + 0 + 5 + 1 = 666.

It is not a de Polignac number, because 101321553051 - 25 = 101321553019 is a prime.

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

It is a Harshad number since it is a multiple of its sum of digits (27).

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

It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 625441605 + ... + 625441766.

Almost surely, 2101321553051 is an apocalyptic number.

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

101321553051 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 2250, while the sum is 27.

Adding to 101321553051 its reverse (150355123101), we get a palindrome (251676676152).

The spelling of 101321553051 in words is "one hundred one billion, three hundred twenty-one million, five hundred fifty-three thousand, fifty-one".

Divisors: 1 3 9 27 81 1250883371 3752650113 11257950339 33773851017 101321553051