Base | Representation |
---|---|
bin | 1001010100011001100100… |
… | …0000100001011101010010 |
3 | 1100021111212211011020101122 |
4 | 2111012121000201131102 |
5 | 2320332414344131200 |
6 | 33442550555402242 |
7 | 2105153006312201 |
oct | 225063100413522 |
9 | 40244784136348 |
10 | 10246064052050 |
11 | 32a0371052322 |
12 | 119590a153382 |
13 | 594279961118 |
14 | 275caad01238 |
15 | 12b7cc43a385 |
hex | 95199021752 |
10246064052050 has 24 divisors (see below), whose sum is σ = 19500880981296. Its totient is φ = 4003113396240.
The previous prime is 10246064052001. The next prime is 10246064052053. The reversal of 10246064052050 is 5025046064201.
It is a super-2 number, since 2×102460640520502 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10246064052050.
It is not an unprimeable number, because it can be changed into a prime (10246064052053) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 2382803444 + ... + 2382807743.
It is an arithmetic number, because the mean of its divisors is an integer number (812536707554).
Almost surely, 210246064052050 is an apocalyptic number.
10246064052050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10246064052050 is a deficient number, since it is larger than the sum of its proper divisors (9254816929246).
10246064052050 is a wasteful number, since it uses less digits than its factorization.
10246064052050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4765611242 (or 4765611237 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 35.
The spelling of 10246064052050 in words is "ten trillion, two hundred forty-six billion, sixty-four million, fifty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •