Base | Representation |
---|---|
bin | 110000010100111100001… |
… | …101111111010111101001 |
3 | 102202111010121001222002221 |
4 | 300110330031333113221 |
5 | 413402422111121301 |
6 | 11021353332354041 |
7 | 461635654256242 |
oct | 60247415772751 |
9 | 12674117058087 |
10 | 3321020020201 |
11 | 107048924a2a4 |
12 | 457776a75921 |
13 | 1b122b462c90 |
14 | b6a4999dcc9 |
15 | 5b5c24a6da1 |
hex | 3053c37f5e9 |
3321020020201 has 48 divisors (see below), whose sum is σ = 3899162534400. Its totient is φ = 2808526763520.
The previous prime is 3321020020189. The next prime is 3321020020231. The reversal of 3321020020201 is 1020200201233.
It is not a de Polignac number, because 3321020020201 - 25 = 3321020020169 is a prime.
It is a super-2 number, since 2×33210200202012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3321020020231) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 225927750 + ... + 225942448.
It is an arithmetic number, because the mean of its divisors is an integer number (81232552800).
Almost surely, 23321020020201 is an apocalyptic number.
3321020020201 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
3321020020201 is a deficient number, since it is larger than the sum of its proper divisors (578142514199).
3321020020201 is a wasteful number, since it uses less digits than its factorization.
3321020020201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16334 (or 16315 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 3321020020201 its reverse (1020200201233), we get a palindrome (4341220221434).
The spelling of 3321020020201 in words is "three trillion, three hundred twenty-one billion, twenty million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •