Base | Representation |
---|---|
bin | 1001001111011010110111… |
… | …11101111001011111101000 |
3 | 2122221200010202010100011221 |
4 | 10213231123331321133220 |
5 | 10130414434001332222 |
6 | 111115204230231424 |
7 | 4165101101323363 |
oct | 447553375713750 |
9 | 78850122110157 |
10 | 20321033230312 |
11 | 6525113543601 |
12 | 2342428ab5574 |
13 | b4535a890849 |
14 | 5037869a30da |
15 | 2538e3d580c7 |
hex | 127b5bf797e8 |
20321033230312 has 8 divisors (see below), whose sum is σ = 38101937306850. Its totient is φ = 10160516615152.
The previous prime is 20321033230297. The next prime is 20321033230339. The reversal of 20321033230312 is 21303233012302.
20321033230312 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 18901851835876 + 1419181394436 = 4347626^2 + 1191294^2 .
It is a tau number, because it is divible by the number of its divisors (8).
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 as a sum of consecutive naturals, namely, 1270064576887 + ... + 1270064576902.
Almost surely, 220321033230312 is an apocalyptic number.
It is an amenable number.
20321033230312 is a deficient number, since it is larger than the sum of its proper divisors (17780904076538).
20321033230312 is a wasteful number, since it uses less digits than its factorization.
20321033230312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2540129153795 (or 2540129153791 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 20321033230312 its reverse (21303233012302), we get a palindrome (41624266242614).
The spelling of 20321033230312 in words is "twenty trillion, three hundred twenty-one billion, thirty-three million, two hundred thirty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •