Base | Representation |
---|---|
bin | 1001100111001001111100… |
… | …0100110110100001110000 |
3 | 1101102022121012002222121111 |
4 | 2121302133010312201300 |
5 | 2341122323312204144 |
6 | 34251001001403104 |
7 | 2140351016125432 |
oct | 231623704664160 |
9 | 41368535088544 |
10 | 10568288397424 |
11 | 3404a933161aa |
12 | 1228256499494 |
13 | 5b877bc41244 |
14 | 287717902652 |
15 | 134d8ac90534 |
hex | 99c9f136870 |
10568288397424 has 40 divisors (see below), whose sum is σ = 21366792437760. Its totient is φ = 5054287558848.
The previous prime is 10568288397383. The next prime is 10568288397431. The reversal of 10568288397424 is 42479388286501.
It is a super-2 number, since 2×105682883974242 (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 10568288397424.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17843289 + ... + 18426055.
It is an arithmetic number, because the mean of its divisors is an integer number (534169810944).
It is a 1-persistent number, because it is pandigital, but 2⋅10568288397424 = 21136576794848 is not.
Almost surely, 210568288397424 is an apocalyptic number.
It is an amenable number.
10568288397424 is an abundant number, since it is smaller than the sum of its proper divisors (10798504040336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10568288397424 is a wasteful number, since it uses less digits than its factorization.
10568288397424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 632077 (or 632071 counting only the distinct ones).
The product of its (nonzero) digits is 185794560, while the sum is 67.
The spelling of 10568288397424 in words is "ten trillion, five hundred sixty-eight billion, two hundred eighty-eight million, three hundred ninety-seven thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •