Base | Representation |
---|---|
bin | 1011001110101010… |
… | …1001100110100000 |
3 | 21210001221102010222 |
4 | 2303222221212200 |
5 | 22133130131422 |
6 | 1215034542212 |
7 | 134461100543 |
oct | 26352514640 |
9 | 7701842128 |
10 | 3014302112 |
11 | 1307549878 |
12 | 701597968 |
13 | 390651323 |
14 | 20848a85a |
15 | 12996b842 |
hex | b3aa99a0 |
3014302112 has 48 divisors (see below), whose sum is σ = 6155299584. Its totient is φ = 1451520000.
The previous prime is 3014302097. The next prime is 3014302141. The reversal of 3014302112 is 2112034103.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 202112 + ... + 216512.
It is an arithmetic number, because the mean of its divisors is an integer number (128235408).
Almost surely, 23014302112 is an apocalyptic number.
3014302112 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3014302112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3077649792).
3014302112 is an abundant number, since it is smaller than the sum of its proper divisors (3140997472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3014302112 is a wasteful number, since it uses less digits than its factorization.
3014302112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14653 (or 14645 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 3014302112 is about 54902.6603362715. The cubic root of 3014302112 is about 1444.5378505558.
Adding to 3014302112 its reverse (2112034103), we get a palindrome (5126336215).
The spelling of 3014302112 in words is "three billion, fourteen million, three hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •