Base | Representation |
---|---|
bin | 110010000010101011… |
… | …0110100101000110011 |
3 | 101021101100120102200100 |
4 | 1210011112310220303 |
5 | 3230041244120001 |
6 | 121211315323443 |
7 | 10523026235604 |
oct | 1440526645063 |
9 | 337340512610 |
10 | 107464051251 |
11 | 416367232a7 |
12 | 189b15b0583 |
13 | a197cc1c0b |
14 | 52b6495dab |
15 | 2bde66a586 |
hex | 19055b4a33 |
107464051251 has 24 divisors (see below), whose sum is σ = 156622617216. Its totient is φ = 71000691840.
The previous prime is 107464051241. The next prime is 107464051259. The reversal of 107464051251 is 152150464701.
107464051251 is a `hidden beast` number, since 1 + 0 + 7 + 4 + 640 + 5 + 1 + 2 + 5 + 1 = 666.
It is not a de Polignac number, because 107464051251 - 29 = 107464050739 is a prime.
It is a super-2 number, since 2×1074640512512 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (107464051259) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 377086 + ... + 597596.
It is an arithmetic number, because the mean of its divisors is an integer number (6525942384).
Almost surely, 2107464051251 is an apocalyptic number.
107464051251 is a deficient number, since it is larger than the sum of its proper divisors (49158565965).
107464051251 is a wasteful number, since it uses less digits than its factorization.
107464051251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221003 (or 221000 counting only the distinct ones).
The product of its (nonzero) digits is 33600, while the sum is 36.
The spelling of 107464051251 in words is "one hundred seven billion, four hundred sixty-four million, fifty-one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.215 sec. • engine limits •