Base | Representation |
---|---|
bin | 1010010011011111111010… |
… | …0101100110111101011011 |
3 | 1111010010222011002201121110 |
4 | 2210313332211212331123 |
5 | 2441113021102000243 |
6 | 40032550500511403 |
7 | 2246400304150233 |
oct | 244677645467533 |
9 | 44103864081543 |
10 | 11330100031323 |
11 | 3679083102257 |
12 | 132ba236ab563 |
13 | 64256826c888 |
14 | 2b2546120cc3 |
15 | 149ac6650e33 |
hex | a4dfe966f5b |
11330100031323 has 16 divisors (see below), whose sum is σ = 15617233447200. Its totient is φ = 7301563672320.
The previous prime is 11330100031321. The next prime is 11330100031337. The reversal of 11330100031323 is 32313000103311.
It is not a de Polignac number, because 11330100031323 - 21 = 11330100031321 is a prime.
It is a super-3 number, since 3×113301000313233 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 11330100031323.
It is not an unprimeable number, because it can be changed into a prime (11330100031321) 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, 422530788 + ... + 422557601.
It is an arithmetic number, because the mean of its divisors is an integer number (976077090450).
Almost surely, 211330100031323 is an apocalyptic number.
11330100031323 is a deficient number, since it is larger than the sum of its proper divisors (4287133415877).
11330100031323 is a wasteful number, since it uses less digits than its factorization.
11330100031323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 845088542.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 11330100031323 its reverse (32313000103311), we get a palindrome (43643100134634).
The spelling of 11330100031323 in words is "eleven trillion, three hundred thirty billion, one hundred million, thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •