Base | Representation |
---|---|
bin | 11101011000000101000… |
… | …11101101101000010111 |
3 | 10120111100001100102102212 |
4 | 32230002203231220113 |
5 | 113014132204342220 |
6 | 2051405500424035 |
7 | 132631613255030 |
oct | 16540243555027 |
9 | 3514301312385 |
10 | 1009360230935 |
11 | 35a081599a41 |
12 | 14375484801b |
13 | 7424a574a24 |
14 | 36bd362da87 |
15 | 1b3c839d0c5 |
hex | eb028eda17 |
1009360230935 has 16 divisors (see below), whose sum is σ = 1385332804416. Its totient is φ = 691599057408.
The previous prime is 1009360230911. The next prime is 1009360230937. The reversal of 1009360230935 is 5390320639001.
1009360230935 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1009360230935 - 228 = 1009091795479 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1009360230892 and 1009360230901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1009360230937) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11072132 + ... + 11162921.
It is an arithmetic number, because the mean of its divisors is an integer number (86583300276).
Almost surely, 21009360230935 is an apocalyptic number.
1009360230935 is a deficient number, since it is larger than the sum of its proper divisors (375972573481).
1009360230935 is a wasteful number, since it uses less digits than its factorization.
1009360230935 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22236362.
The product of its (nonzero) digits is 131220, while the sum is 41.
Adding to 1009360230935 its reverse (5390320639001), we get a palindrome (6399680869936).
The spelling of 1009360230935 in words is "one trillion, nine billion, three hundred sixty million, two hundred thirty thousand, nine hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •