Base | Representation |
---|---|
bin | 1010111010100011001101… |
… | …1010001010010011101001 |
3 | 1120111021200101212022122001 |
4 | 2232220303122022103221 |
5 | 3033111022241333001 |
6 | 41305103411331001 |
7 | 2346020665262434 |
oct | 256506332122351 |
9 | 46437611768561 |
10 | 12001001121001 |
11 | 39076612a3932 |
12 | 1419a5abb0a61 |
13 | 6908c6c30089 |
14 | 2d6bcc93c81b |
15 | 15c290c74001 |
hex | aea3368a4e9 |
12001001121001 has 8 divisors (see below), whose sum is σ = 12256656407424. Its totient is φ = 11745358952880.
The previous prime is 12001001120981. The next prime is 12001001121007. The reversal of 12001001121001 is 10012110010021.
12001001121001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12001001121001 - 213 = 12001001112809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12001001121007) 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, 1419310 + ... + 5100631.
It is an arithmetic number, because the mean of its divisors is an integer number (1532082050928).
Almost surely, 212001001121001 is an apocalyptic number.
It is an amenable number.
12001001121001 is a deficient number, since it is larger than the sum of its proper divisors (255655286423).
12001001121001 is an equidigital number, since it uses as much as digits as its factorization.
12001001121001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6559151.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 12001001121001 its reverse (10012110010021), we get a palindrome (22013111131022).
The spelling of 12001001121001 in words is "twelve trillion, one billion, one million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •