Base | Representation |
---|---|
bin | 10001101001001100011… |
… | …11101111110101101010 |
3 | 2010221210100120001100210 |
4 | 20310212033233311222 |
5 | 34413030401113200 |
6 | 1142255452441550 |
7 | 61540665261033 |
oct | 10644617576552 |
9 | 2127710501323 |
10 | 606232051050 |
11 | 21411320880a |
12 | 995a9a792b6 |
13 | 45223b22c92 |
14 | 214adc19a8a |
15 | 10b82041650 |
hex | 8d263efd6a |
606232051050 has 48 divisors (see below), whose sum is σ = 1503570149280. Its totient is φ = 161649551040.
The previous prime is 606232051043. The next prime is 606232051069. The reversal of 606232051050 is 50150232606.
It is a super-2 number, since 2×6062320510502 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 606232050999 and 606232051017.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1911196 + ... + 2205704.
It is an arithmetic number, because the mean of its divisors is an integer number (31324378110).
Almost surely, 2606232051050 is an apocalyptic number.
606232051050 is an abundant number, since it is smaller than the sum of its proper divisors (897338098230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
606232051050 is a wasteful number, since it uses less digits than its factorization.
606232051050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 308247 (or 308242 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 606232051050 its reverse (50150232606), we get a palindrome (656382283656).
The spelling of 606232051050 in words is "six hundred six billion, two hundred thirty-two million, fifty-one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •