Base | Representation |
---|---|
bin | 10010111001011001… |
… | …01011100010101001 |
3 | 222012000220002001201 |
4 | 21130230223202221 |
5 | 131234124314040 |
6 | 4354405444201 |
7 | 506256235063 |
oct | 113454534251 |
9 | 28160802051 |
10 | 10145151145 |
11 | 4336745238 |
12 | 1b71710661 |
13 | c58aac31c |
14 | 6c3548733 |
15 | 3e59d0a9a |
hex | 25cb2b8a9 |
10145151145 has 8 divisors (see below), whose sum is σ = 12174813504. Its totient is φ = 8115699504.
The previous prime is 10145151143. The next prime is 10145151169. The reversal of 10145151145 is 54115154101.
10145151145 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10145151145 - 21 = 10145151143 is a prime.
It is a super-2 number, since 2×101451511452 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10145151143) 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 7 ways as a sum of consecutive naturals, for example, 86842 + ... + 166828.
It is an arithmetic number, because the mean of its divisors is an integer number (1521851688).
Almost surely, 210145151145 is an apocalyptic number.
It is an amenable number.
10145151145 is a deficient number, since it is larger than the sum of its proper divisors (2029662359).
10145151145 is an equidigital number, since it uses as much as digits as its factorization.
10145151145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105359.
The product of its (nonzero) digits is 2000, while the sum is 28.
The spelling of 10145151145 in words is "ten billion, one hundred forty-five million, one hundred fifty-one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •