Base | Representation |
---|---|
bin | 1100001101011010110… |
… | …01000011011001101100 |
3 | 1111002212010111110222001 |
4 | 12012231121003121230 |
5 | 23333134314303422 |
6 | 520420351502044 |
7 | 42211055263450 |
oct | 6065531033154 |
9 | 1432763443861 |
10 | 419520853612 |
11 | 151a10648673 |
12 | 69380827924 |
13 | 307399829b3 |
14 | 1643a9a0660 |
15 | ada556a227 |
hex | 61ad64366c |
419520853612 has 48 divisors (see below), whose sum is σ = 855407552832. Its totient is φ = 176291930880.
The previous prime is 419520853523. The next prime is 419520853667. The reversal of 419520853612 is 216358025914.
It is a super-2 number, since 2×4195208536122 (a number of 24 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2306062 + ... + 2481322.
It is an arithmetic number, because the mean of its divisors is an integer number (17820990684).
Almost surely, 2419520853612 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 419520853612, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (427703776416).
419520853612 is an abundant number, since it is smaller than the sum of its proper divisors (435886699220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
419520853612 is a wasteful number, since it uses less digits than its factorization.
419520853612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176938 (or 176936 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 46.
The spelling of 419520853612 in words is "four hundred nineteen billion, five hundred twenty million, eight hundred fifty-three thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •