Search a number
-
+
10120151055 = 357213768913
BaseRepresentation
bin10010110110011010…
…10100000000001111
3222010021211221101110
421123031110000033
5131211224313210
64352113543103
7505533602400
oct113315240017
928107757343
1010120151055
11432361a303
121b65274a93
13c53868081
146c00bb9a7
153e36e3420
hex25b35400f

10120151055 has 24 divisors (see below), whose sum is σ = 18835874352. Its totient is φ = 4626354432.

The previous prime is 10120151029. The next prime is 10120151113. The reversal of 10120151055 is 55015102101.

It is not a de Polignac number, because 10120151055 - 25 = 10120151023 is a prime.

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

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6883722 + ... + 6885191.

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

Almost surely, 210120151055 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 250, while the sum is 21.

Adding to 10120151055 its reverse (55015102101), we get a palindrome (65135253156).

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

Divisors: 1 3 5 7 15 21 35 49 105 147 245 735 13768913 41306739 68844565 96382391 206533695 289147173 481911955 674676737 1445735865 2024030211 3373383685 10120151055