Base | Representation |
---|---|
bin | 10010101111111101… |
… | …100010100101100001 |
3 | 1220222000221022000012 |
4 | 102233331202211201 |
5 | 312212243430213 |
6 | 13125402534305 |
7 | 1311614204426 |
oct | 225775424541 |
9 | 56860838005 |
10 | 20132014433 |
11 | 85a0aa7463 |
12 | 3a9a207395 |
13 | 1b8ab4a29b |
14 | d8da4bd4d |
15 | 7cc6464a8 |
hex | 4aff62961 |
20132014433 has 12 divisors (see below), whose sum is σ = 21377775888. Its totient is φ = 18955370520.
The previous prime is 20132014421. The next prime is 20132014439. The reversal of 20132014433 is 33441023102.
It is not a de Polignac number, because 20132014433 - 210 = 20132013409 is a prime.
It is a super-2 number, since 2×201320144332 (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 = 20132014399 and 20132014408.
It is not an unprimeable number, because it can be changed into a prime (20132014439) 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 11 ways as a sum of consecutive naturals, for example, 112223 + ... + 229908.
It is an arithmetic number, because the mean of its divisors is an integer number (1781481324).
Almost surely, 220132014433 is an apocalyptic number.
It is an amenable number.
20132014433 is a deficient number, since it is larger than the sum of its proper divisors (1245761455).
20132014433 is a wasteful number, since it uses less digits than its factorization.
20132014433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 342332 (or 342313 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 20132014433 its reverse (33441023102), we get a palindrome (53573037535).
The spelling of 20132014433 in words is "twenty billion, one hundred thirty-two million, fourteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •