Base | Representation |
---|---|
bin | 1001001111001011001101… |
… | …10101011000101001110001 |
3 | 2122220212102210201011000220 |
4 | 10213211212311120221301 |
5 | 10130300224124112200 |
6 | 111111254050003253 |
7 | 4164352540625655 |
oct | 447454665305161 |
9 | 78825383634026 |
10 | 20312625613425 |
11 | 65215996785a2 |
12 | 2340881276529 |
13 | b4461aa70202 |
14 | 5031ca110a65 |
15 | 2535a0b924a0 |
hex | 127966d58a71 |
20312625613425 has 12 divisors (see below), whose sum is σ = 33583541014320. Its totient is φ = 10833400327120.
The previous prime is 20312625613411. The next prime is 20312625613433. The reversal of 20312625613425 is 52431652621302.
It is not a de Polignac number, because 20312625613425 - 24 = 20312625613409 is a prime.
It is a super-2 number, since 2×203126256134252 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 135417504015 + ... + 135417504164.
It is an arithmetic number, because the mean of its divisors is an integer number (2798628417860).
Almost surely, 220312625613425 is an apocalyptic number.
20312625613425 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
20312625613425 is a deficient number, since it is larger than the sum of its proper divisors (13270915400895).
20312625613425 is a wasteful number, since it uses less digits than its factorization.
20312625613425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270835008192 (or 270835008187 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 42.
The spelling of 20312625613425 in words is "twenty trillion, three hundred twelve billion, six hundred twenty-five million, six hundred thirteen thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •