Base | Representation |
---|---|
bin | 1010111010100011001101… |
… | …1101100011100101111001 |
3 | 1120111021200110112112111000 |
4 | 2232220303131203211321 |
5 | 3033111023003323001 |
6 | 41305103442355213 |
7 | 2346021005660253 |
oct | 256506335434571 |
9 | 46437613475430 |
10 | 12001002011001 |
11 | 3907661851573 |
12 | 1419a5b35bb09 |
13 | 6908c71821c3 |
14 | 2d6bccad0cd3 |
15 | 15c290d9ca86 |
hex | aea33763979 |
12001002011001 has 8 divisors (see below), whose sum is σ = 17779262238560. Its totient is φ = 8000668007316.
The previous prime is 12001002010957. The next prime is 12001002011017. The reversal of 12001002011001 is 10011020010021.
It is a happy number.
It is not a de Polignac number, because 12001002011001 - 215 = 12001001978233 is a prime.
It is a super-2 number, since 2×120010020110012 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12001002011071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 222240777955 + ... + 222240778008.
It is an arithmetic number, because the mean of its divisors is an integer number (2222407779820).
Almost surely, 212001002011001 is an apocalyptic number.
It is an amenable number.
12001002011001 is a deficient number, since it is larger than the sum of its proper divisors (5778260227559).
12001002011001 is an equidigital number, since it uses as much as digits as its factorization.
12001002011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 444481555972 (or 444481555966 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 12001002011001 its reverse (10011020010021), we get a palindrome (22012022021022).
The spelling of 12001002011001 in words is "twelve trillion, one billion, two million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •