Base | Representation |
---|---|
bin | 1010111010100011010000… |
… | …0011101101000000001110 |
3 | 1120111021201011100120221011 |
4 | 2232220310003231000032 |
5 | 3033111033033323042 |
6 | 41305104440555434 |
7 | 2346021156656656 |
oct | 256506403550016 |
9 | 46437634316834 |
10 | 12001012011022 |
11 | 3907667461751 |
12 | 1419a62782b7a |
13 | 6908c9273a88 |
14 | 2d6bd0175366 |
15 | 15c291bc5a17 |
hex | aea340ed00e |
12001012011022 has 8 divisors (see below), whose sum is σ = 18784192712976. Its totient is φ = 5739614440032.
The previous prime is 12001012011013. The next prime is 12001012011029. The reversal of 12001012011022 is 22011021010021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 12001012010993 and 12001012011011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12001012011029) 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 3 ways as a sum of consecutive naturals, for example, 130445782683 + ... + 130445782774.
It is an arithmetic number, because the mean of its divisors is an integer number (2348024089122).
Almost surely, 212001012011022 is an apocalyptic number.
12001012011022 is a deficient number, since it is larger than the sum of its proper divisors (6783180701954).
12001012011022 is a wasteful number, since it uses less digits than its factorization.
12001012011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 260891565482.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 12001012011022 its reverse (22011021010021), we get a palindrome (34012033021043).
It can be divided in two parts, 1200101 and 2011022, that added together give a palindrome (3211123).
The spelling of 12001012011022 in words is "twelve trillion, one billion, twelve million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •