Base | Representation |
---|---|
bin | 11101011011100100001… |
… | …00111001111010111001 |
3 | 10120200011102220122121120 |
4 | 32231302010321322321 |
5 | 113032000141444001 |
6 | 2052315254055453 |
7 | 133026152255055 |
oct | 16556204717271 |
9 | 3520142818546 |
10 | 1011231203001 |
11 | 35a951718a48 |
12 | 143b9734a589 |
13 | 74488083ba6 |
14 | 36d2dcdcc65 |
15 | 1b487775236 |
hex | eb72139eb9 |
1011231203001 has 4 divisors (see below), whose sum is σ = 1348308270672. Its totient is φ = 674154135332.
The previous prime is 1011231202999. The next prime is 1011231203051. The reversal of 1011231203001 is 1003021321101.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1011231203001 - 21 = 1011231202999 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1011231203051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 168538533831 + ... + 168538533836.
It is an arithmetic number, because the mean of its divisors is an integer number (337077067668).
Almost surely, 21011231203001 is an apocalyptic number.
It is an amenable number.
1011231203001 is a deficient number, since it is larger than the sum of its proper divisors (337077067671).
1011231203001 is an equidigital number, since it uses as much as digits as its factorization.
1011231203001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337077067670.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1011231203001 its reverse (1003021321101), we get a palindrome (2014252524102).
The spelling of 1011231203001 in words is "one trillion, eleven billion, two hundred thirty-one million, two hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •