Base | Representation |
---|---|
bin | 10110110010000011… |
… | …01001001010111011 |
3 | 1011120101211020220210 |
4 | 23121001221022323 |
5 | 200022120134433 |
6 | 5341401122203 |
7 | 612044652030 |
oct | 133101511273 |
9 | 34511736823 |
10 | 12231021243 |
11 | 5207102321 |
12 | 2454189363 |
13 | 11cbc9089c |
14 | 840597387 |
15 | 4b8ba6463 |
hex | 2d90692bb |
12231021243 has 16 divisors (see below), whose sum is σ = 18740723456. Its totient is φ = 6950538720.
The previous prime is 12231021241. The next prime is 12231021251. The reversal of 12231021243 is 34212013221.
12231021243 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12231021243 - 21 = 12231021241 is a prime.
It is a super-3 number, since 3×122310212433 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (12231021241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1605121 + ... + 1612722.
It is an arithmetic number, because the mean of its divisors is an integer number (1171295216).
Almost surely, 212231021243 is an apocalyptic number.
12231021243 is a deficient number, since it is larger than the sum of its proper divisors (6509702213).
12231021243 is a wasteful number, since it uses less digits than its factorization.
12231021243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3218034.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 12231021243 its reverse (34212013221), we get a palindrome (46443034464).
The spelling of 12231021243 in words is "twelve billion, two hundred thirty-one million, twenty-one thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •