Base | Representation |
---|---|
bin | 11110001000000011000… |
… | …11101001010111000001 |
3 | 10122221210211011211111110 |
4 | 33010001203221113001 |
5 | 113424402442140001 |
6 | 2111305141033533 |
7 | 134533033240101 |
oct | 17040143512701 |
9 | 3587724154443 |
10 | 1035113240001 |
11 | 369a97490905 |
12 | 1487413b58a9 |
13 | 767c2aba529 |
14 | 381579cd201 |
15 | 1bdd42143d6 |
hex | f1018e95c1 |
1035113240001 has 8 divisors (see below), whose sum is σ = 1380157609824. Its totient is φ = 690072181760.
The previous prime is 1035113239991. The next prime is 1035113240053. The reversal of 1035113240001 is 1000423115301.
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 1035113240001 - 210 = 1035113238977 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1035113240001.
It is not an unprimeable number, because it can be changed into a prime (1035113230001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27790 + ... + 1439096.
It is an arithmetic number, because the mean of its divisors is an integer number (172519701228).
Almost surely, 21035113240001 is an apocalyptic number.
It is an amenable number.
1035113240001 is a deficient number, since it is larger than the sum of its proper divisors (345044369823).
1035113240001 is a wasteful number, since it uses less digits than its factorization.
1035113240001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1655791.
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 1035113240001 its reverse (1000423115301), we get a palindrome (2035536355302).
The spelling of 1035113240001 in words is "one trillion, thirty-five billion, one hundred thirteen million, two hundred forty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •