Base | Representation |
---|---|
bin | 1001001011111011101010… |
… | …11010010001000100101001 |
3 | 2122112012211102122222022100 |
4 | 10211331311122101010221 |
5 | 10121434024424404113 |
6 | 110544145330044013 |
7 | 4153326410303415 |
oct | 445756532210451 |
9 | 78465742588270 |
10 | 20201201013033 |
11 | 6489310367097 |
12 | 2323165419609 |
13 | b36c713904c1 |
14 | 4dba59a53d45 |
15 | 25072d995d73 |
hex | 125f75691129 |
20201201013033 has 24 divisors (see below), whose sum is σ = 29267788245696. Its totient is φ = 13426774639200.
The previous prime is 20201201013001. The next prime is 20201201013043. The reversal of 20201201013033 is 33031010210202.
It is not a de Polignac number, because 20201201013033 - 25 = 20201201013001 is a prime.
It is a super-3 number, since 3×202012010130333 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20201201012997 and 20201201013015.
It is not an unprimeable number, because it can be changed into a prime (20201201013043) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2779516 + ... + 6937442.
It is an arithmetic number, because the mean of its divisors is an integer number (1219491176904).
Almost surely, 220201201013033 is an apocalyptic number.
It is an amenable number.
20201201013033 is a deficient number, since it is larger than the sum of its proper divisors (9066587232663).
20201201013033 is a wasteful number, since it uses less digits than its factorization.
20201201013033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4159565 (or 4159562 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 20201201013033 its reverse (33031010210202), we get a palindrome (53232211223235).
The spelling of 20201201013033 in words is "twenty trillion, two hundred one billion, two hundred one million, thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.684 sec. • engine limits •