Base | Representation |
---|---|
bin | 101011101100110001100… |
… | …001100100010100011001 |
3 | 101122002022010210200222121 |
4 | 223230301201210110121 |
5 | 343200132313214001 |
6 | 10215322023021241 |
7 | 426650314346515 |
oct | 53546141442431 |
9 | 11562263720877 |
10 | 3003013023001 |
11 | a58630621532 |
12 | 406006b9a821 |
13 | 18a24bb23c54 |
14 | a54bd12d145 |
15 | 531ae00b6a1 |
hex | 2bb31864519 |
3003013023001 has 4 divisors (see below), whose sum is σ = 3003640354512. Its totient is φ = 3002385691492.
The previous prime is 3003013022987. The next prime is 3003013023047. The reversal of 3003013023001 is 1003203103003.
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 3003013023001 - 29 = 3003013022489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3003013023091) 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 3 ways as a sum of consecutive naturals, for example, 313658575 + ... + 313668148.
It is an arithmetic number, because the mean of its divisors is an integer number (750910088628).
Almost surely, 23003013023001 is an apocalyptic number.
It is an amenable number.
3003013023001 is a deficient number, since it is larger than the sum of its proper divisors (627331511).
3003013023001 is an equidigital number, since it uses as much as digits as its factorization.
3003013023001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 627331510.
The product of its (nonzero) digits is 162, while the sum is 16.
Adding to 3003013023001 its reverse (1003203103003), we get a palindrome (4006216126004).
The spelling of 3003013023001 in words is "three trillion, three billion, thirteen million, twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •