Base | Representation |
---|---|
bin | 10010101111011100… |
… | …110011100001010011 |
3 | 1220221102210022112221 |
4 | 102233130303201103 |
5 | 312203044324133 |
6 | 13124455001511 |
7 | 1311451234000 |
oct | 225734634123 |
9 | 56842708487 |
10 | 20123433043 |
11 | 85971760aa |
12 | 3a97369297 |
13 | 1b8913433c |
14 | d8c8568a7 |
15 | 7cb9eda2d |
hex | 4af733853 |
20123433043 has 8 divisors (see below), whose sum is σ = 23467560800. Its totient is φ = 17248656600.
The previous prime is 20123433013. The next prime is 20123433047. The reversal of 20123433043 is 34033432102.
It is not a de Polignac number, because 20123433043 - 29 = 20123432531 is a prime.
It is a super-2 number, since 2×201234330432 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20123432999 and 20123433017.
It is not an unprimeable number, because it can be changed into a prime (20123433047) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 29334108 + ... + 29334793.
It is an arithmetic number, because the mean of its divisors is an integer number (2933445100).
Almost surely, 220123433043 is an apocalyptic number.
20123433043 is a deficient number, since it is larger than the sum of its proper divisors (3344127757).
20123433043 is an frugal number, since it uses more digits than its factorization.
20123433043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58668922 (or 58668908 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 20123433043 its reverse (34033432102), we get a palindrome (54156865145).
The spelling of 20123433043 in words is "twenty billion, one hundred twenty-three million, four hundred thirty-three thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •