Base | Representation |
---|---|
bin | 11001000000111… |
… | …111110000100000 |
3 | 1002020201112120120 |
4 | 121000333300200 |
5 | 1324420112202 |
6 | 105351240240 |
7 | 13254214350 |
oct | 3100776040 |
9 | 1066645516 |
10 | 419691552 |
11 | 1a59a5525 |
12 | b8679080 |
13 | 68c474c7 |
14 | 3da4cb60 |
15 | 26ca30bc |
hex | 1903fc20 |
419691552 has 48 divisors (see below), whose sum is σ = 1259076672. Its totient is φ = 119911680.
The previous prime is 419691523. The next prime is 419691583. The reversal of 419691552 is 255196914.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×4196915522 = 352281997640337408, which contains 22 as substring.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 311599 + ... + 312942.
It is an arithmetic number, because the mean of its divisors is an integer number (26230764).
Almost surely, 2419691552 is an apocalyptic number.
419691552 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
419691552 is an abundant number, since it is smaller than the sum of its proper divisors (839385120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
419691552 is a wasteful number, since it uses less digits than its factorization.
419691552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 624561 (or 624553 counting only the distinct ones).
The product of its digits is 97200, while the sum is 42.
The square root of 419691552 is about 20486.3747891129. The cubic root of 419691552 is about 748.7038662289.
The spelling of 419691552 in words is "four hundred nineteen million, six hundred ninety-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •