Base | Representation |
---|---|
bin | 1100001110000101001… |
… | …11010000110010100000 |
3 | 1111010202221110111210022 |
4 | 12013002213100302200 |
5 | 23334401441300000 |
6 | 520515551053012 |
7 | 42222640522535 |
oct | 6070247206240 |
9 | 1433687414708 |
10 | 419876900000 |
11 | 152083622588 |
12 | 6945bb11168 |
13 | 3079567502c |
14 | 16471da2d8c |
15 | adc694a585 |
hex | 61c29d0ca0 |
419876900000 has 144 divisors (see below), whose sum is σ = 1058435615160. Its totient is φ = 163852800000.
The previous prime is 419876899969. The next prime is 419876900017. The reversal of 419876900000 is 9678914.
It can be written as a sum of positive squares in 12 ways, for example, as 152227946896 + 267648953104 = 390164^2 + 517348^2 .
It is a super-2 number, since 2×4198769000002 (a number of 24 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4048796 + ... + 4151204.
Almost surely, 2419876900000 is an apocalyptic number.
419876900000 is a gapful number since it is divisible by the number (40) 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 419876900000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (529217807580).
419876900000 is an abundant number, since it is smaller than the sum of its proper divisors (638558715160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
419876900000 is an equidigital number, since it uses as much as digits as its factorization.
419876900000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102485 (or 102457 counting only the distinct ones).
The product of its (nonzero) digits is 108864, while the sum is 44.
The spelling of 419876900000 in words is "four hundred nineteen billion, eight hundred seventy-six million, nine hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •