Base | Representation |
---|---|
bin | 10010111010000000… |
… | …11000011000011111 |
3 | 222012101121110022000 |
4 | 21131000120120133 |
5 | 131241440044201 |
6 | 4355112253343 |
7 | 506351154465 |
oct | 113500303037 |
9 | 28171543260 |
10 | 10150315551 |
11 | 4339652342 |
12 | 1b733a1253 |
13 | c59b99b9c |
14 | 6c40d0835 |
15 | 3e61a0d86 |
hex | 25d01861f |
10150315551 has 8 divisors (see below), whose sum is σ = 15037504560. Its totient is φ = 6766877016.
The previous prime is 10150315537. The next prime is 10150315577. The reversal of 10150315551 is 15551305101.
10150315551 is a `hidden beast` number, since 1 + 0 + 1 + 503 + 155 + 5 + 1 = 666.
10150315551 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10150315551 - 213 = 10150307359 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 375937613 = 10150315551 / (1 + 0 + 1 + 5 + 0 + 3 + 1 + 5 + 5 + 5 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10150316551) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 187968780 + ... + 187968833.
It is an arithmetic number, because the mean of its divisors is an integer number (1879688070).
Almost surely, 210150315551 is an apocalyptic number.
10150315551 is a deficient number, since it is larger than the sum of its proper divisors (4887189009).
10150315551 is an equidigital number, since it uses as much as digits as its factorization.
10150315551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 375937622 (or 375937616 counting only the distinct ones).
The product of its (nonzero) digits is 1875, while the sum is 27.
The spelling of 10150315551 in words is "ten billion, one hundred fifty million, three hundred fifteen thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •