Base | Representation |
---|---|
bin | 11101011100000101011… |
… | …010000000100010010000 |
3 | 21011101202202121021111210 |
4 | 131130011122000202100 |
5 | 231121121144103212 |
6 | 4145210201540120 |
7 | 266105220554415 |
oct | 35340532004220 |
9 | 7141682537453 |
10 | 2023020300432 |
11 | 70aa5a24626a |
12 | 2880a94a4640 |
13 | 118a018b0611 |
14 | 6dcb3d4410c |
15 | 37953e9c53c |
hex | 1d705680890 |
2023020300432 has 160 divisors (see below), whose sum is σ = 5412226345344. Its totient is φ = 650643148800.
The previous prime is 2023020300403. The next prime is 2023020300443. The reversal of 2023020300432 is 2340030203202.
It is a super-2 number, since 2×20230203004322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2023020300399 and 2023020300408.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 265449582 + ... + 265457202.
Almost surely, 22023020300432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2023020300432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2706113172672).
2023020300432 is an abundant number, since it is smaller than the sum of its proper divisors (3389206044912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2023020300432 is a wasteful number, since it uses less digits than its factorization.
2023020300432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8897 (or 8891 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 21.
Adding to 2023020300432 its reverse (2340030203202), we get a palindrome (4363050503634).
The spelling of 2023020300432 in words is "two trillion, twenty-three billion, twenty million, three hundred thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •