Base | Representation |
---|---|
bin | 100101010000001… |
… | …1111001000101001 |
3 | 10020010011002221220 |
4 | 1022200133020221 |
5 | 10030001430441 |
6 | 324012252253 |
7 | 42656036454 |
oct | 11240371051 |
9 | 3203132856 |
10 | 1250030121 |
11 | 59167814a |
12 | 2aa771089 |
13 | 16bc904c2 |
14 | bc03449b |
15 | 74b1e466 |
hex | 4a81f229 |
1250030121 has 16 divisors (see below), whose sum is σ = 1756435200. Its totient is φ = 788589648.
The previous prime is 1250030113. The next prime is 1250030129. The reversal of 1250030121 is 1210300521.
It is an interprime number because it is at equal distance from previous prime (1250030113) and next prime (1250030129).
It is not a de Polignac number, because 1250030121 - 23 = 1250030113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1250030121.
It is not an unprimeable number, because it can be changed into a prime (1250030129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39610 + ... + 63788.
It is an arithmetic number, because the mean of its divisors is an integer number (109777200).
Almost surely, 21250030121 is an apocalyptic number.
It is an amenable number.
1250030121 is a deficient number, since it is larger than the sum of its proper divisors (506405079).
1250030121 is a wasteful number, since it uses less digits than its factorization.
1250030121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25108.
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 1250030121 is about 35355.7650320284. The cubic root of 1250030121 is about 1077.2259974434.
Adding to 1250030121 its reverse (1210300521), we get a palindrome (2460330642).
The spelling of 1250030121 in words is "one billion, two hundred fifty million, thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •