Base | Representation |
---|---|
bin | 101010100000010… |
… | …0110001111100000 |
3 | 10200101200111000222 |
4 | 1111000212033200 |
5 | 10410103020000 |
6 | 353304502212 |
7 | 50225445542 |
oct | 12500461740 |
9 | 3611614028 |
10 | 1426220000 |
11 | 672078217 |
12 | 33977a968 |
13 | 19962c07a |
14 | d75b9692 |
15 | 85323a85 |
hex | 550263e0 |
1426220000 has 120 divisors (see below), whose sum is σ = 3631181400. Its totient is φ = 550592000.
The previous prime is 1426219999. The next prime is 1426220017. The reversal of 1426220000 is 226241.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 578771 + ... + 581229.
It is an arithmetic number, because the mean of its divisors is an integer number (30259845).
Almost surely, 21426220000 is an apocalyptic number.
1426220000 is a gapful number since it is divisible by the number (10) 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 1426220000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1815590700).
1426220000 is an abundant number, since it is smaller than the sum of its proper divisors (2204961400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1426220000 is an equidigital number, since it uses as much as digits as its factorization.
1426220000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2518 (or 2495 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 1426220000 is about 37765.3280139336. The cubic root of 1426220000 is about 1125.6296064227.
Adding to 1426220000 its reverse (226241), we get a palindrome (1426446241).
The spelling of 1426220000 in words is "one billion, four hundred twenty-six million, two hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •