Base | Representation |
---|---|
bin | 11101010011000100101… |
… | …000000100101110110011 |
3 | 21010110210101001121111011 |
4 | 131103010220010232303 |
5 | 230441311421042003 |
6 | 4140530043131351 |
7 | 265313346446404 |
oct | 35230450045663 |
9 | 7113711047434 |
10 | 2013343534003 |
11 | 706943a3443a |
12 | 286248813b57 |
13 | 117b1bb67119 |
14 | 6d636ac19ab |
15 | 3758968c46d |
hex | 1d4c4a04bb3 |
2013343534003 has 8 divisors (see below), whose sum is σ = 2106759829376. Its totient is φ = 1921706596800.
The previous prime is 2013343533967. The next prime is 2013343534049. The reversal of 2013343534003 is 3004353433102.
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 2013343534003 - 213 = 2013343525811 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is not an unprimeable number, because it can be changed into a prime (2013043534003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 444837228 + ... + 444841753.
It is an arithmetic number, because the mean of its divisors is an integer number (263344978672).
Almost surely, 22013343534003 is an apocalyptic number.
2013343534003 is a deficient number, since it is larger than the sum of its proper divisors (93416295373).
2013343534003 is an equidigital number, since it uses as much as digits as its factorization.
2013343534003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 889679085.
The product of its (nonzero) digits is 38880, while the sum is 31.
Adding to 2013343534003 its reverse (3004353433102), we get a palindrome (5017696967105).
The spelling of 2013343534003 in words is "two trillion, thirteen billion, three hundred forty-three million, five hundred thirty-four thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •