Base | Representation |
---|---|
bin | 10010111001010001… |
… | …10111110011000010 |
3 | 222011222000100112212 |
4 | 21130220313303002 |
5 | 131233400342040 |
6 | 4354332222122 |
7 | 506244606263 |
oct | 113450676302 |
9 | 28158010485 |
10 | 10144152770 |
11 | 4336123134 |
12 | 1b7130a942 |
13 | c5881ca7b |
14 | 6c336896a |
15 | 3e5884d65 |
hex | 25ca37cc2 |
10144152770 has 8 divisors (see below), whose sum is σ = 18259475004. Its totient is φ = 4057661104.
The previous prime is 10144152751. The next prime is 10144152779. The reversal of 10144152770 is 7725144101.
10144152770 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 9922351321 + 221801449 = 99611^2 + 14893^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (10144152779) 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 3 ways as a sum of consecutive naturals, for example, 507207629 + ... + 507207648.
Almost surely, 210144152770 is an apocalyptic number.
10144152770 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10144152770 is a deficient number, since it is larger than the sum of its proper divisors (8115322234).
10144152770 is a wasteful number, since it uses less digits than its factorization.
10144152770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1014415284.
The product of its (nonzero) digits is 7840, while the sum is 32.
Adding to 10144152770 its reverse (7725144101), we get a palindrome (17869296871).
The spelling of 10144152770 in words is "ten billion, one hundred forty-four million, one hundred fifty-two thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •