Base | Representation |
---|---|
bin | 1010100011010001010101… |
… | …10010000110100011101000 |
3 | 10001011002202102002002002201 |
4 | 11101220222302012203220 |
5 | 11020120431031010440 |
6 | 121202524544505544 |
7 | 4613204303251024 |
oct | 521505262064350 |
9 | 101132672062081 |
10 | 23202131110120 |
11 | 7435a72151546 |
12 | 272888a91b2b4 |
13 | cc3c4a7c3cc1 |
14 | 5a2dbc29d384 |
15 | 2a3819bae19a |
hex | 151a2ac868e8 |
23202131110120 has 16 divisors (see below), whose sum is σ = 52204794997860. Its totient is φ = 9280852444032.
The previous prime is 23202131110099. The next prime is 23202131110139. The reversal of 23202131110120 is 2101113120232.
It can be written as a sum of positive squares in 2 ways, for example, as 22590647773444 + 611483336676 = 4752962^2 + 781974^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 290026638837 + ... + 290026638916.
Almost surely, 223202131110120 is an apocalyptic number.
23202131110120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23202131110120 is an abundant number, since it is smaller than the sum of its proper divisors (29002663887740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23202131110120 is a wasteful number, since it uses less digits than its factorization.
23202131110120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 580053277764 (or 580053277760 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 23202131110120 its reverse (2101113120232), we get a palindrome (25303244230352).
The spelling of 23202131110120 in words is "twenty-three trillion, two hundred two billion, one hundred thirty-one million, one hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •