Base | Representation |
---|---|
bin | 1001011000011011100011… |
… | …0000101011001000001011 |
3 | 1100112010122010101010211221 |
4 | 2112012320300223020023 |
5 | 2323001231424320003 |
6 | 33534442454302511 |
7 | 2113154103245320 |
oct | 226067060531013 |
9 | 40463563333757 |
10 | 10315316245003 |
11 | 3317779111940 |
12 | 11a7216657a37 |
13 | 59a96519b1a3 |
14 | 27939a496b47 |
15 | 12d4d20837bd |
hex | 961b8c2b20b |
10315316245003 has 32 divisors (see below), whose sum is σ = 12916859208192. Its totient is φ = 8002850380800.
The previous prime is 10315316244979. The next prime is 10315316245009. The reversal of 10315316245003 is 30054261351301.
It is not a de Polignac number, because 10315316245003 - 237 = 10177877291531 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10315316245003.
It is not an unprimeable number, because it can be changed into a prime (10315316245009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17458608 + ... + 18039778.
It is an arithmetic number, because the mean of its divisors is an integer number (403651850256).
Almost surely, 210315316245003 is an apocalyptic number.
10315316245003 is a deficient number, since it is larger than the sum of its proper divisors (2601542963189).
10315316245003 is a wasteful number, since it uses less digits than its factorization.
10315316245003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 582195.
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 10315316245003 its reverse (30054261351301), we get a palindrome (40369577596304).
The spelling of 10315316245003 in words is "ten trillion, three hundred fifteen billion, three hundred sixteen million, two hundred forty-five thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •