Base | Representation |
---|---|
bin | 11101010010110010000… |
… | …111110111101010110001 |
3 | 21010102222201221000211121 |
4 | 131102302013313222301 |
5 | 230440142433231001 |
6 | 4140435153342241 |
7 | 265302560021005 |
oct | 35226207675261 |
9 | 7112881830747 |
10 | 2013033102001 |
11 | 7067a4785269 |
12 | 286180867981 |
13 | 117a9c755c4c |
14 | 6d607794705 |
15 | 3756c2bc6a1 |
hex | 1d4b21f7ab1 |
2013033102001 has 4 divisors (see below), whose sum is σ = 2013261682752. Its totient is φ = 2012804521252.
The previous prime is 2013033101999. The next prime is 2013033102013. The reversal of 2013033102001 is 1002013303102.
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 2013033102001 - 21 = 2013033101999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2013033102061) 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, 114277165 + ... + 114294778.
It is an arithmetic number, because the mean of its divisors is an integer number (503315420688).
Almost surely, 22013033102001 is an apocalyptic number.
It is an amenable number.
2013033102001 is a deficient number, since it is larger than the sum of its proper divisors (228580751).
2013033102001 is an equidigital number, since it uses as much as digits as its factorization.
2013033102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228580750.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 2013033102001 its reverse (1002013303102), we get a palindrome (3015046405103).
The spelling of 2013033102001 in words is "two trillion, thirteen billion, thirty-three million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •