Base | Representation |
---|---|
bin | 10100111000100101… |
… | …10100010110110010 |
3 | 1001221101120101000200 |
4 | 22130102310112302 |
5 | 140430300111310 |
6 | 5052322300030 |
7 | 544563251025 |
oct | 123422642662 |
9 | 31841511020 |
10 | 11212113330 |
11 | 4833a44770 |
12 | 220aab7616 |
13 | 1098b633b2 |
14 | 7851271bc |
15 | 4594dc9c0 |
hex | 29c4b45b2 |
11212113330 has 96 divisors (see below), whose sum is σ = 32661240768. Its totient is φ = 2644617600.
The previous prime is 11212113317. The next prime is 11212113337. The reversal of 11212113330 is 3331121211.
11212113330 is a `hidden beast` number, since 1 + 121 + 211 + 3 + 330 = 666.
It is a super-2 number, since 2×112121133302 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (11212113337) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 116416 + ... + 189675.
It is an arithmetic number, because the mean of its divisors is an integer number (340221258).
Almost surely, 211212113330 is an apocalyptic number.
11212113330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11212113330 is an abundant number, since it is smaller than the sum of its proper divisors (21449127438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11212113330 is a wasteful number, since it uses less digits than its factorization.
11212113330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 306152 (or 306149 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 11212113330 its reverse (3331121211), we get a palindrome (14543234541).
The spelling of 11212113330 in words is "eleven billion, two hundred twelve million, one hundred thirteen thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •