Base | Representation |
---|---|
bin | 1010010010111010010101… |
… | …0111000110110111010111 |
3 | 1111002011221011210200201110 |
4 | 2210232211113012313113 |
5 | 2440431341324414111 |
6 | 40024201531230103 |
7 | 2245562322640314 |
oct | 244564527066727 |
9 | 44064834720643 |
10 | 11320013123031 |
11 | 3674877328808 |
12 | 1329a895a8333 |
13 | 64161b5737a2 |
14 | 2b1c6a617d0b |
15 | 1496d5d275a6 |
hex | a4ba55c6dd7 |
11320013123031 has 16 divisors (see below), whose sum is σ = 15127953746400. Its totient is φ = 7529376153600.
The previous prime is 11320013122967. The next prime is 11320013123047. The reversal of 11320013123031 is 13032131002311.
It is a happy number.
It is not a de Polignac number, because 11320013123031 - 26 = 11320013122967 is a prime.
It is a super-2 number, since 2×113200131230312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11320013122989 and 11320013123007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11320013123231) 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, 20979831 + ... + 21512631.
It is an arithmetic number, because the mean of its divisors is an integer number (945497109150).
Almost surely, 211320013123031 is an apocalyptic number.
11320013123031 is a deficient number, since it is larger than the sum of its proper divisors (3807940623369).
11320013123031 is a wasteful number, since it uses less digits than its factorization.
11320013123031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 549026.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 11320013123031 its reverse (13032131002311), we get a palindrome (24352144125342).
The spelling of 11320013123031 in words is "eleven trillion, three hundred twenty billion, thirteen million, one hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •