Base | Representation |
---|---|
bin | 1001010101101111110111… |
… | …1101111111101111000000 |
3 | 1100100201200111002202200010 |
4 | 2111123331331333233000 |
5 | 2321222342034144203 |
6 | 33501342000424520 |
7 | 2106633105632352 |
oct | 225337575775700 |
9 | 40321614082603 |
10 | 10269232724928 |
11 | 32aa180178161 |
12 | 119a2b5318140 |
13 | 5964cc959508 |
14 | 277067d790d2 |
15 | 12c1d6467303 |
hex | 956fdf7fbc0 |
10269232724928 has 112 divisors (see below), whose sum is σ = 27808223515776. Its totient is φ = 3342789381120.
The previous prime is 10269232724827. The next prime is 10269232724957. The reversal of 10269232724928 is 82942723296201.
It is a super-2 number, since 2×102692327249282 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41180458 + ... + 41429078.
Almost surely, 210269232724928 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10269232724928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13904111757888).
10269232724928 is an abundant number, since it is smaller than the sum of its proper divisors (17538990790848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10269232724928 is a wasteful number, since it uses less digits than its factorization.
10269232724928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253682 (or 253672 counting only the distinct ones).
The product of its (nonzero) digits is 10450944, while the sum is 57.
The spelling of 10269232724928 in words is "ten trillion, two hundred sixty-nine billion, two hundred thirty-two million, seven hundred twenty-four thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •