Base | Representation |
---|---|
bin | 1010111011000100110001… |
… | …1100001100101011100001 |
3 | 1120112010221022120121112000 |
4 | 2232301030130030223201 |
5 | 3033233000310120001 |
6 | 41313153424554213 |
7 | 2346460161202521 |
oct | 256611434145341 |
9 | 46463838517460 |
10 | 12010011020001 |
11 | 3910465136355 |
12 | 141b754482969 |
13 | 691701767c67 |
14 | 2d74053ad681 |
15 | 15c61bc58a86 |
hex | aec4c70cae1 |
12010011020001 has 16 divisors (see below), whose sum is σ = 17822213949120. Its totient is φ = 7993351749600.
The previous prime is 12010011019999. The next prime is 12010011020003. The reversal of 12010011020001 is 10002011001021.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (12010011019999) and next prime (12010011020003).
It is not a de Polignac number, because 12010011020001 - 21 = 12010011019999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (12010011020003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 370046355 + ... + 370078808.
It is an arithmetic number, because the mean of its divisors is an integer number (1113888371820).
Almost surely, 212010011020001 is an apocalyptic number.
It is an amenable number.
12010011020001 is a deficient number, since it is larger than the sum of its proper divisors (5812202929119).
12010011020001 is an equidigital number, since it uses as much as digits as its factorization.
12010011020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 740125773 (or 740125767 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 12010011020001 its reverse (10002011001021), we get a palindrome (22012022021022).
The spelling of 12010011020001 in words is "twelve trillion, ten billion, eleven million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •