Base | Representation |
---|---|
bin | 1011001001111000100001… |
… | …1110000110001010111011 |
3 | 1121102110121121020220010220 |
4 | 2302132020132012022323 |
5 | 3101420013313033201 |
6 | 42030110342311123 |
7 | 2404034535215346 |
oct | 262361036061273 |
9 | 47373547226126 |
10 | 12264421221051 |
11 | 39a934805695a |
12 | 1460b15a284a3 |
13 | 6ac6b741c06c |
14 | 30585b7d345d |
15 | 16405bd24036 |
hex | b27887862bb |
12264421221051 has 32 divisors (see below), whose sum is σ = 16822364133120. Its totient is φ = 7944650294400.
The previous prime is 12264421220971. The next prime is 12264421221071. The reversal of 12264421221051 is 15012212446221.
12264421221051 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 12264421221051 - 29 = 12264421220539 is a prime.
It is a super-2 number, since 2×122644212210512 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12264421221071) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 215974380 + ... + 216031158.
It is an arithmetic number, because the mean of its divisors is an integer number (525698879160).
Almost surely, 212264421221051 is an apocalyptic number.
12264421221051 is a deficient number, since it is larger than the sum of its proper divisors (4557942912069).
12264421221051 is a wasteful number, since it uses less digits than its factorization.
12264421221051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71147.
The product of its (nonzero) digits is 15360, while the sum is 33.
Adding to 12264421221051 its reverse (15012212446221), we get a palindrome (27276633667272).
The spelling of 12264421221051 in words is "twelve trillion, two hundred sixty-four billion, four hundred twenty-one million, two hundred twenty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •