Base | Representation |
---|---|
bin | 1001010001101001011001… |
… | …10110110010011000110111 |
3 | 2200012222122111011012122222 |
4 | 10220310230312302120313 |
5 | 10133143141333422000 |
6 | 111214301154312555 |
7 | 4203450234254531 |
oct | 450645466623067 |
9 | 80188574135588 |
10 | 20397552248375 |
11 | 655460a532405 |
12 | 2355222b8875b |
13 | b4c633787523 |
14 | 5073652d0851 |
15 | 2558c1924a85 |
hex | 128d2cdb2637 |
20397552248375 has 32 divisors (see below), whose sum is σ = 25676035786752. Its totient is φ = 16177281120000.
The previous prime is 20397552248371. The next prime is 20397552248399. The reversal of 20397552248375 is 57384225579302.
It is not a de Polignac number, because 20397552248375 - 22 = 20397552248371 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20397552248371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20484545 + ... + 21457205.
It is an arithmetic number, because the mean of its divisors is an integer number (802376118336).
Almost surely, 220397552248375 is an apocalyptic number.
20397552248375 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
20397552248375 is a deficient number, since it is larger than the sum of its proper divisors (5278483538377).
20397552248375 is a wasteful number, since it uses less digits than its factorization.
20397552248375 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 974124 (or 974114 counting only the distinct ones).
The product of its (nonzero) digits is 127008000, while the sum is 62.
The spelling of 20397552248375 in words is "twenty trillion, three hundred ninety-seven billion, five hundred fifty-two million, two hundred forty-eight thousand, three hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •