Base | Representation |
---|---|
bin | 1011001110101001… |
… | …0000111010111101 |
3 | 21210001202021110212 |
4 | 2303222100322331 |
5 | 22133113413041 |
6 | 1215032442205 |
7 | 134460200036 |
oct | 26352207275 |
9 | 7701667425 |
10 | 3014201021 |
11 | 130748a927 |
12 | 701549365 |
13 | 390617300 |
14 | 208461a8d |
15 | 12994b8eb |
hex | b3a90ebd |
3014201021 has 48 divisors (see below), whose sum is σ = 3592304640. Its totient is φ = 2518102080.
The previous prime is 3014201011. The next prime is 3014201077. The reversal of 3014201021 is 1201024103.
It is not a de Polignac number, because 3014201021 - 26 = 3014200957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3014200987 and 3014201005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3014201011) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10650746 + ... + 10651028.
It is an arithmetic number, because the mean of its divisors is an integer number (74839680).
Almost surely, 23014201021 is an apocalyptic number.
3014201021 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
3014201021 is a deficient number, since it is larger than the sum of its proper divisors (578103619).
3014201021 is a wasteful number, since it uses less digits than its factorization.
3014201021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 466 (or 453 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 3014201021 is about 54901.7396901045. The cubic root of 3014201021 is about 1444.5217018307.
Adding to 3014201021 its reverse (1201024103), we get a palindrome (4215225124).
The spelling of 3014201021 in words is "three billion, fourteen million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •