Search a number
-
+
10101451551 = 313744635507
BaseRepresentation
bin10010110100001011…
…11110101100011111
3222001222122220111020
421122011332230133
5131141432422201
64350205055223
7505215631032
oct113205765437
928058586436
1010101451551
114314008074
121b5ab57513
13c4ca1b889
146bb811019
153e1c4ca36
hex25a17eb1f

10101451551 has 16 divisors (see below), whose sum is σ = 13572417024. Its totient is φ = 6682433984.

The previous prime is 10101451519. The next prime is 10101451567. The reversal of 10101451551 is 15515410101.

It is a cyclic number.

It is not a de Polignac number, because 10101451551 - 25 = 10101451519 is a prime.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1831540 + ... + 1837046.

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

Almost surely, 210101451551 is an apocalyptic number.

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

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

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

The sum of its prime factors is 10110.

The product of its (nonzero) digits is 500, while the sum is 24.

Adding to 10101451551 its reverse (15515410101), we get a palindrome (25616861652).

The spelling of 10101451551 in words is "ten billion, one hundred one million, four hundred fifty-one thousand, five hundred fifty-one".

Divisors: 1 3 137 411 4463 5507 13389 16521 611431 754459 1834293 2263377 24577741 73733223 3367150517 10101451551