Base | Representation |
---|---|
bin | 1010111010100011001101… |
… | …1001101111101111111101 |
3 | 1120111021200101122210102011 |
4 | 2232220303121233233331 |
5 | 3033111022224342341 |
6 | 41305103405131221 |
7 | 2346020664330334 |
oct | 256506331575775 |
9 | 46437611583364 |
10 | 12001001012221 |
11 | 390766122a131 |
12 | 1419a5ab59b11 |
13 | 6908c6bc2700 |
14 | 2d6bcc910d1b |
15 | 15c290c51b81 |
hex | aea3366fbfd |
12001001012221 has 24 divisors (see below), whose sum is σ = 13760512974144. Its totient is φ = 10425508404480.
The previous prime is 12001001012213. The next prime is 12001001012269. The reversal of 12001001012221 is 12221010010021.
It is not a de Polignac number, because 12001001012221 - 23 = 12001001012213 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12001001012521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 45166126 + ... + 45431056.
It is an arithmetic number, because the mean of its divisors is an integer number (573354707256).
Almost surely, 212001001012221 is an apocalyptic number.
It is an amenable number.
12001001012221 is a deficient number, since it is larger than the sum of its proper divisors (1759511961923).
12001001012221 is a wasteful number, since it uses less digits than its factorization.
12001001012221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280741 (or 280728 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 12001001012221 its reverse (12221010010021), we get a palindrome (24222011022242).
The spelling of 12001001012221 in words is "twelve trillion, one billion, one million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •