Base | Representation |
---|---|
bin | 1011001110011001… |
… | …1101000101111101 |
3 | 21202222212112111020 |
4 | 2303212131011331 |
5 | 22132334433201 |
6 | 1214555214353 |
7 | 134445540234 |
oct | 26346350575 |
9 | 7688775436 |
10 | 3013202301 |
11 | 130696853a |
12 | 7011473b9 |
13 | 390357855 |
14 | 208281b1b |
15 | 129800a36 |
hex | b399d17d |
3013202301 has 4 divisors (see below), whose sum is σ = 4017603072. Its totient is φ = 2008801532.
The previous prime is 3013202293. The next prime is 3013202317. The reversal of 3013202301 is 1032023103.
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 3013202301 - 23 = 3013202293 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3013202371) 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, 502200381 + ... + 502200386.
It is an arithmetic number, because the mean of its divisors is an integer number (1004400768).
Almost surely, 23013202301 is an apocalyptic number.
It is an amenable number.
3013202301 is a deficient number, since it is larger than the sum of its proper divisors (1004400771).
3013202301 is a wasteful number, since it uses less digits than its factorization.
3013202301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1004400770.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 3013202301 is about 54892.6434142135. The cubic root of 3013202301 is about 1444.3621424571.
Adding to 3013202301 its reverse (1032023103), we get a palindrome (4045225404).
The spelling of 3013202301 in words is "three billion, thirteen million, two hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •