Base | Representation |
---|---|
bin | 1001100101100001101111… |
… | …0000000000000000010111 |
3 | 1101022122101200211000112012 |
4 | 2121120123300000000113 |
5 | 2340143031204442101 |
6 | 34230053133214435 |
7 | 2135340560620112 |
oct | 231303360000027 |
9 | 41278350730465 |
10 | 10540315312151 |
11 | 33a4139232209 |
12 | 122294a33141b |
13 | 5b5c41788091 |
14 | 28622275b579 |
15 | 1342a0093bbb |
hex | 9961bc00017 |
10540315312151 has 8 divisors (see below), whose sum is σ = 10564404891264. Its totient is φ = 10516238173240.
The previous prime is 10540315312133. The next prime is 10540315312187. The reversal of 10540315312151 is 15121351304501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10540315312151 is a prime.
It is a super-2 number, since 2×105403153121512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10540315512151) 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, 1412501 + ... + 4803726.
It is an arithmetic number, because the mean of its divisors is an integer number (1320550611408).
Almost surely, 210540315312151 is an apocalyptic number.
10540315312151 is a deficient number, since it is larger than the sum of its proper divisors (24089579113).
10540315312151 is an equidigital number, since it uses as much as digits as its factorization.
10540315312151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6220101.
The product of its (nonzero) digits is 9000, while the sum is 32.
Adding to 10540315312151 its reverse (15121351304501), we get a palindrome (25661666616652).
The spelling of 10540315312151 in words is "ten trillion, five hundred forty billion, three hundred fifteen million, three hundred twelve thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •