Base | Representation |
---|---|
bin | 10101000101110011… |
… | …11001011110011100 |
3 | 1002020010021002001000 |
4 | 22202321321132130 |
5 | 141142143134322 |
6 | 5111323350300 |
7 | 550411043436 |
oct | 124271713634 |
9 | 32203232030 |
10 | 11323021212 |
11 | 4890606478 |
12 | 2240082390 |
13 | 10b5b25a69 |
14 | 795b57656 |
15 | 4640e93ac |
hex | 2a2e7979c |
11323021212 has 48 divisors (see below), whose sum is σ = 29769465600. Its totient is φ = 3721178160.
The previous prime is 11323021211. The next prime is 11323021247. The reversal of 11323021212 is 21212032311.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11323021211) 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, 730662 + ... + 745997.
It is an arithmetic number, because the mean of its divisors is an integer number (620197200).
Almost surely, 211323021212 is an apocalyptic number.
11323021212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11323021212 is an abundant number, since it is smaller than the sum of its proper divisors (18446444388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11323021212 is a wasteful number, since it uses less digits than its factorization.
11323021212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1476743 (or 1476735 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 11323021212 its reverse (21212032311), we get a palindrome (32535053523).
The spelling of 11323021212 in words is "eleven billion, three hundred twenty-three million, twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •