Base | Representation |
---|---|
bin | 11110010001101111010… |
… | …00000011101110001001 |
3 | 10200110020100211120020112 |
4 | 33020313220003232021 |
5 | 114021031211133023 |
6 | 2113525252004105 |
7 | 135105661301351 |
oct | 17106750035611 |
9 | 3613210746215 |
10 | 1040315333513 |
11 | 371216980745 |
12 | 149753600635 |
13 | 77141787281 |
14 | 384cc859b61 |
15 | 1c0dac8a478 |
hex | f237a03b89 |
1040315333513 has 8 divisors (see below), whose sum is σ = 1048590578688. Its totient is φ = 1032041397744.
The previous prime is 1040315333503. The next prime is 1040315333521. The reversal of 1040315333513 is 3153335130401.
1040315333513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1040315333513 - 216 = 1040315267977 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 1040315333513.
It is not an unprimeable number, because it can be changed into a prime (1040315333503) 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, 1299995 + ... + 1941807.
It is an arithmetic number, because the mean of its divisors is an integer number (131073822336).
Almost surely, 21040315333513 is an apocalyptic number.
It is an amenable number.
1040315333513 is a deficient number, since it is larger than the sum of its proper divisors (8275245175).
1040315333513 is a wasteful number, since it uses less digits than its factorization.
1040315333513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 654703.
The product of its (nonzero) digits is 24300, while the sum is 32.
The spelling of 1040315333513 in words is "one trillion, forty billion, three hundred fifteen million, three hundred thirty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •