Base | Representation |
---|---|
bin | 1010010011100100011011… |
… | …1000101110001001001000 |
3 | 1111010021002200111222020111 |
4 | 2210321012320232021020 |
5 | 2441123012112013112 |
6 | 40033311111004104 |
7 | 2246442333214123 |
oct | 244710670561110 |
9 | 44107080458214 |
10 | 11331313001032 |
11 | 3679645867362 |
12 | 1330101969634 |
13 | 6426cc65552b |
14 | 2b261d2693ba |
15 | 149b47d9e5a7 |
hex | a4e46e2e248 |
11331313001032 has 64 divisors (see below), whose sum is σ = 21669659965440. Its totient is φ = 5554031616000.
The previous prime is 11331313001017. The next prime is 11331313001033. The reversal of 11331313001032 is 23010031313311.
It is a junction number, because it is equal to n+sod(n) for n = 11331313000994 and 11331313001012.
It is not an unprimeable number, because it can be changed into a prime (11331313001033) 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 15 ways as a sum of consecutive naturals, for example, 50272008 + ... + 50496904.
It is an arithmetic number, because the mean of its divisors is an integer number (338588436960).
Almost surely, 211331313001032 is an apocalyptic number.
It is an amenable number.
11331313001032 is a deficient number, since it is larger than the sum of its proper divisors (10338346964408).
11331313001032 is a wasteful number, since it uses less digits than its factorization.
11331313001032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225622 (or 225618 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 11331313001032 its reverse (23010031313311), we get a palindrome (34341344314343).
The spelling of 11331313001032 in words is "eleven trillion, three hundred thirty-one billion, three hundred thirteen million, one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •