Base | Representation |
---|---|
bin | 1001011101001100110101… |
… | …0000110001011010111000 |
3 | 1100210222011020122000012120 |
4 | 2113103031100301122320 |
5 | 2330322044213113303 |
6 | 34040234251441240 |
7 | 2122114623520551 |
oct | 227231520613270 |
9 | 40728136560176 |
10 | 10397264582328 |
11 | 3349500889658 |
12 | 11bb086a56220 |
13 | 5a55c4b5c210 |
14 | 27d331cbd328 |
15 | 1306cb60c553 |
hex | 974cd4316b8 |
10397264582328 has 64 divisors (see below), whose sum is σ = 28895623680000. Its totient is φ = 3095959674240.
The previous prime is 10397264582323. The next prime is 10397264582347. The reversal of 10397264582328 is 82328546279301.
It is a super-2 number, since 2×103972645823282 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10397264582323) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 537483328 + ... + 537502671.
It is an arithmetic number, because the mean of its divisors is an integer number (451494120000).
It is a 1-persistent number, because it is pandigital, but 2⋅10397264582328 = 20794529164656 is not.
Almost surely, 210397264582328 is an apocalyptic number.
It is an amenable number.
10397264582328 is an abundant number, since it is smaller than the sum of its proper divisors (18498359097672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10397264582328 is a wasteful number, since it uses less digits than its factorization.
10397264582328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1074986052 (or 1074986048 counting only the distinct ones).
The product of its (nonzero) digits is 34836480, while the sum is 60.
The spelling of 10397264582328 in words is "ten trillion, three hundred ninety-seven billion, two hundred sixty-four million, five hundred eighty-two thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •