Base | Representation |
---|---|
bin | 1011001110100111… |
… | …1011101101001010 |
3 | 21210001120212021101 |
4 | 2303221323231022 |
5 | 22133103122442 |
6 | 1215030532014 |
7 | 134456355505 |
oct | 26351735512 |
9 | 7701525241 |
10 | 3014114122 |
11 | 1307430608 |
12 | 70150700a |
13 | 3905b68a6 |
14 | 20843c13c |
15 | 129930cb7 |
hex | b3a7bb4a |
3014114122 has 8 divisors (see below), whose sum is σ = 4522740516. Its totient is φ = 1506533952.
The previous prime is 3014114113. The next prime is 3014114123. The reversal of 3014114122 is 2214114103.
It can be written as a sum of positive squares in 2 ways, for example, as 2283979681 + 730134441 = 47791^2 + 27021^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 3014114122.
It is not an unprimeable number, because it can be changed into a prime (3014114123) 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, 254313 + ... + 265900.
Almost surely, 23014114122 is an apocalyptic number.
3014114122 is a deficient number, since it is larger than the sum of its proper divisors (1508626394).
3014114122 is a wasteful number, since it uses less digits than its factorization.
3014114122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523112.
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 3014114122 is about 54900.9482796062. The cubic root of 3014114122 is about 1444.5078199101.
Subtracting from 3014114122 its sum of digits (19), we obtain a palindrome (3014114103).
Adding to 3014114122 its reverse (2214114103), we get a palindrome (5228228225).
The spelling of 3014114122 in words is "three billion, fourteen million, one hundred fourteen thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •