Base | Representation |
---|---|
bin | 100100101100010… |
… | …1110100101101010 |
3 | 10011210202102000120 |
4 | 1021120232211222 |
5 | 10010143002200 |
6 | 322101144110 |
7 | 42340121625 |
oct | 11130564552 |
9 | 3153672016 |
10 | 1231219050 |
11 | 581a9a106 |
12 | 2a43bb036 |
13 | 1681052a9 |
14 | b9738dbc |
15 | 731559a0 |
hex | 4962e96a |
1231219050 has 96 divisors (see below), whose sum is σ = 3302145792. Its totient is φ = 302407680.
The previous prime is 1231219039. The next prime is 1231219063. The reversal of 1231219050 is 509121321.
It is a self number, because there is not a number n which added to its sum of digits gives 1231219050.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 114714 + ... + 124986.
It is an arithmetic number, because the mean of its divisors is an integer number (34397352).
Almost surely, 21231219050 is an apocalyptic number.
1231219050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1231219050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1651072896).
1231219050 is an abundant number, since it is smaller than the sum of its proper divisors (2070926742).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1231219050 is a wasteful number, since it uses less digits than its factorization.
1231219050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10352 (or 10347 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 24.
The square root of 1231219050 is about 35088.7310970346. The cubic root of 1231219050 is about 1071.7951204260.
The spelling of 1231219050 in words is "one billion, two hundred thirty-one million, two hundred nineteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •