Base | Representation |
---|---|
bin | 1010010011100000010111… |
… | …1010101111110010101001 |
3 | 1111010011021201111211210121 |
4 | 2210320011322233302221 |
5 | 2441113244042404113 |
6 | 40033011012443241 |
7 | 2246403326400421 |
oct | 244700572576251 |
9 | 44104251454717 |
10 | 11330223013033 |
11 | 3679136570231 |
12 | 132ba58919521 |
13 | 64258789ba12 |
14 | 2b25585b5481 |
15 | 149ad2344e8d |
hex | a4e05eafca9 |
11330223013033 has 64 divisors (see below), whose sum is σ = 13191284160000. Its totient is φ = 9665406091264.
The previous prime is 11330223013027. The next prime is 11330223013127. The reversal of 11330223013033 is 33031032203311.
It is not a de Polignac number, because 11330223013033 - 25 = 11330223013001 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11330223012989 and 11330223013007.
It is not an unprimeable number, because it can be changed into a prime (11330223013013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 412759893 + ... + 412787341.
It is an arithmetic number, because the mean of its divisors is an integer number (206113815000).
Almost surely, 211330223013033 is an apocalyptic number.
It is an amenable number.
11330223013033 is a deficient number, since it is larger than the sum of its proper divisors (1861061146967).
11330223013033 is a wasteful number, since it uses less digits than its factorization.
11330223013033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28194.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 11330223013033 its reverse (33031032203311), we get a palindrome (44361255216344).
The spelling of 11330223013033 in words is "eleven trillion, three hundred thirty billion, two hundred twenty-three million, thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •