Base | Representation |
---|---|
bin | 10010110110011010… |
… | …01100111011000010 |
3 | 222010021210110121012 |
4 | 21123031030323002 |
5 | 131211222401200 |
6 | 4352113200522 |
7 | 505533422003 |
oct | 113315147302 |
9 | 28107713535 |
10 | 10120122050 |
11 | 43235aa535 |
12 | 1b65260142 |
13 | c53857acc |
14 | 6c00b11aa |
15 | 3e36d9a35 |
hex | 25b34cec2 |
10120122050 has 48 divisors (see below), whose sum is σ = 19466825472. Its totient is φ = 3910171200.
The previous prime is 10120122041. The next prime is 10120122059. The reversal of 10120122050 is 5022102101.
10120122050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10120122041) and next prime (10120122059).
It is not an unprimeable number, because it can be changed into a prime (10120122059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 866852 + ... + 878448.
It is an arithmetic number, because the mean of its divisors is an integer number (405558864).
Almost surely, 210120122050 is an apocalyptic number.
10120122050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10120122050 is a deficient number, since it is larger than the sum of its proper divisors (9346703422).
10120122050 is a wasteful number, since it uses less digits than its factorization.
10120122050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12203 (or 12198 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 14.
Adding to 10120122050 its reverse (5022102101), we get a palindrome (15142224151).
The spelling of 10120122050 in words is "ten billion, one hundred twenty million, one hundred twenty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •