Base | Representation |
---|---|
bin | 10010101111100000… |
… | …10000111100110110 |
3 | 221222020210221222010 |
4 | 21113300100330312 |
5 | 131101411022401 |
6 | 4342243545050 |
7 | 504231220560 |
oct | 112760207466 |
9 | 27866727863 |
10 | 10062204726 |
11 | 42a3941382 |
12 | 1b4998b186 |
13 | c44859ac2 |
14 | 6b6516330 |
15 | 3dd598ed6 |
hex | 257c10f36 |
10062204726 has 32 divisors (see below), whose sum is σ = 23999298048. Its totient is φ = 2749919040.
The previous prime is 10062204721. The next prime is 10062204727. The reversal of 10062204726 is 62740226001.
10062204726 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×100622047263 (a number of 31 digits) contains 333 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10062204693 and 10062204702.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10062204721) 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 15 ways as a sum of consecutive naturals, for example, 5207215 + ... + 5209146.
It is an arithmetic number, because the mean of its divisors is an integer number (749978064).
Almost surely, 210062204726 is an apocalyptic number.
10062204726 is an abundant number, since it is smaller than the sum of its proper divisors (13937093322).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10062204726 is a wasteful number, since it uses less digits than its factorization.
10062204726 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10416396.
The product of its (nonzero) digits is 8064, while the sum is 30.
The spelling of 10062204726 in words is "ten billion, sixty-two million, two hundred four thousand, seven hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •