Base | Representation |
---|---|
bin | 1110001010000011100… |
… | …00111011100001100100 |
3 | 1201111120110121112200000 |
4 | 13011001300323201210 |
5 | 30432204232301322 |
6 | 1011244234421300 |
7 | 50100206206530 |
oct | 7050160734144 |
9 | 1644513545600 |
10 | 486434650212 |
11 | 178328751415 |
12 | 7a335b91830 |
13 | 36b418c2c94 |
14 | 19787770bc0 |
15 | c9bec5a3ac |
hex | 7141c3b864 |
486434650212 has 288 divisors, whose sum is σ = 1510072811520. Its totient is φ = 133964772480.
The previous prime is 486434650187. The next prime is 486434650253. The reversal of 486434650212 is 212056434684.
486434650212 is a `hidden beast` number, since 48 + 6 + 4 + 346 + 50 + 212 = 666.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 143447037 + ... + 143450427.
Almost surely, 2486434650212 is an apocalyptic number.
486434650212 is a gapful number since it is divisible by the number (42) 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 486434650212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (755036405760).
486434650212 is an abundant number, since it is smaller than the sum of its proper divisors (1023638161308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
486434650212 is a wasteful number, since it uses less digits than its factorization.
486434650212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4173 (or 4159 counting only the distinct ones).
The product of its (nonzero) digits is 1105920, while the sum is 45.
The spelling of 486434650212 in words is "four hundred eighty-six billion, four hundred thirty-four million, six hundred fifty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •