Base | Representation |
---|---|
bin | 1001001110111111000001… |
… | …1010001101000000100011 |
3 | 1022221121202220002201212201 |
4 | 2103233300122031000203 |
5 | 2312321412011340230 |
6 | 33332124231234031 |
7 | 2065350552406411 |
oct | 223576032150043 |
9 | 38847686081781 |
10 | 10153041121315 |
11 | 3264976029674 |
12 | 117b888b18917 |
13 | 588573789241 |
14 | 2715a474c2b1 |
15 | 1291859da5ca |
hex | 93bf068d023 |
10153041121315 has 4 divisors (see below), whose sum is σ = 12183649345584. Its totient is φ = 8122432897048.
The previous prime is 10153041121313. The next prime is 10153041121343. The reversal of 10153041121315 is 51312114035101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10153041121315 - 21 = 10153041121313 is a prime.
It is a super-2 number, since 2×101530411213152 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10153041121313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1015304112127 + ... + 1015304112136.
It is an arithmetic number, because the mean of its divisors is an integer number (3045912336396).
Almost surely, 210153041121315 is an apocalyptic number.
10153041121315 is a deficient number, since it is larger than the sum of its proper divisors (2030608224269).
10153041121315 is an equidigital number, since it uses as much as digits as its factorization.
10153041121315 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2030608224268.
The product of its (nonzero) digits is 1800, while the sum is 28.
Adding to 10153041121315 its reverse (51312114035101), we get a palindrome (61465155156416).
The spelling of 10153041121315 in words is "ten trillion, one hundred fifty-three billion, forty-one million, one hundred twenty-one thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •