Base | Representation |
---|---|
bin | 1010010011011111101010… |
… | …0011001111101110110111 |
3 | 1111010010210102122202212012 |
4 | 2210313322203033232313 |
5 | 2441112401232144111 |
6 | 40032540041114435 |
7 | 2246365522364531 |
oct | 244677243175667 |
9 | 44103712582765 |
10 | 11330032303031 |
11 | 3679048952a62 |
12 | 132ba04a88a1b |
13 | 642557218070 |
14 | 2b253b130851 |
15 | 149ac072348b |
hex | a4dfa8cfbb7 |
11330032303031 has 32 divisors (see below), whose sum is σ = 12785260400640. Its totient is φ = 9968654707200.
The previous prime is 11330032303019. The next prime is 11330032303039. The reversal of 11330032303031 is 13030323003311.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11330032303031 is a prime.
It is a super-2 number, since 2×113300323030312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11330032302988 and 11330032303006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11330032303039) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 28674296 + ... + 29066738.
It is an arithmetic number, because the mean of its divisors is an integer number (399539387520).
Almost surely, 211330032303031 is an apocalyptic number.
11330032303031 is a deficient number, since it is larger than the sum of its proper divisors (1455228097609).
11330032303031 is a wasteful number, since it uses less digits than its factorization.
11330032303031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 393567.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 11330032303031 its reverse (13030323003311), we get a palindrome (24360355306342).
The spelling of 11330032303031 in words is "eleven trillion, three hundred thirty billion, thirty-two million, three hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •