Base | Representation |
---|---|
bin | 10010111010011010… |
… | …00011000100110001 |
3 | 222012121212011021222 |
4 | 21131031003010301 |
5 | 131243312324040 |
6 | 4355311354425 |
7 | 506421324512 |
oct | 113515030461 |
9 | 28177764258 |
10 | 10153636145 |
11 | 4340510134 |
12 | 1b74522a15 |
13 | c5a790433 |
14 | 6c4716a09 |
15 | 3e6609bb5 |
hex | 25d343131 |
10153636145 has 8 divisors (see below), whose sum is σ = 12207753000. Its totient is φ = 8107315840.
The previous prime is 10153636133. The next prime is 10153636147. The reversal of 10153636145 is 54163635101.
It can be written as a sum of positive squares in 4 ways, for example, as 1734472609 + 8419163536 = 41647^2 + 91756^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10153636145 - 226 = 10086527281 is a prime.
It is a super-2 number, since 2×101536361452 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10153636147) 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, 1946270 + ... + 1951479.
It is an arithmetic number, because the mean of its divisors is an integer number (1525969125).
Almost surely, 210153636145 is an apocalyptic number.
It is an amenable number.
10153636145 is a deficient number, since it is larger than the sum of its proper divisors (2054116855).
10153636145 is an equidigital number, since it uses as much as digits as its factorization.
10153636145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3898275.
The product of its (nonzero) digits is 32400, while the sum is 35.
The spelling of 10153636145 in words is "ten billion, one hundred fifty-three million, six hundred thirty-six thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •