Base | Representation |
---|---|
bin | 1001001111011110111111… |
… | …10100010010101000011111 |
3 | 2122221212211220112100022001 |
4 | 10213233133310102220133 |
5 | 10130434001244214401 |
6 | 111120211530503131 |
7 | 4165206651541003 |
oct | 447573764225037 |
9 | 78855756470261 |
10 | 20323245304351 |
11 | 652604916a570 |
12 | 2342945894aa7 |
13 | b45620c5bab2 |
14 | 5039166a4703 |
15 | 2539c315c601 |
hex | 127bdfd12a1f |
20323245304351 has 48 divisors (see below), whose sum is σ = 24390607258368. Its totient is φ = 16735231654400.
The previous prime is 20323245304333. The next prime is 20323245304421. The reversal of 20323245304351 is 15340354232302.
It is not a de Polignac number, because 20323245304351 - 219 = 20323244780063 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20323245304351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20323245304651) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 48702276 + ... + 49117798.
It is an arithmetic number, because the mean of its divisors is an integer number (508137651216).
Almost surely, 220323245304351 is an apocalyptic number.
20323245304351 is a deficient number, since it is larger than the sum of its proper divisors (4067361954017).
20323245304351 is a wasteful number, since it uses less digits than its factorization.
20323245304351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 415920 (or 415891 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 37.
Adding to 20323245304351 its reverse (15340354232302), we get a palindrome (35663599536653).
The spelling of 20323245304351 in words is "twenty trillion, three hundred twenty-three billion, two hundred forty-five million, three hundred four thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •