Base | Representation |
---|---|
bin | 101011110110010000111… |
… | …010000010111111101100 |
3 | 101200001121022102211221001 |
4 | 223312100322002333230 |
5 | 343332020010211340 |
6 | 10224125122050044 |
7 | 430460661456250 |
oct | 53662072027754 |
9 | 11601538384831 |
10 | 3013203210220 |
11 | a6198a726a65 |
12 | 407b8b7a9924 |
13 | 18b1b4041128 |
14 | a5ba863c260 |
15 | 535a893629a |
hex | 2bd90e82fec |
3013203210220 has 48 divisors (see below), whose sum is σ = 7657081104960. Its totient is φ = 972327757824.
The previous prime is 3013203210191. The next prime is 3013203210229. The reversal of 3013203210220 is 220123023103.
It is a super-2 number, since 2×30132032102202 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3013203210229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 633023505 + ... + 633028264.
It is an arithmetic number, because the mean of its divisors is an integer number (159522523020).
Almost surely, 23013203210220 is an apocalyptic number.
It is an amenable number.
3013203210220 is an abundant number, since it is smaller than the sum of its proper divisors (4643877894740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3013203210220 is a wasteful number, since it uses less digits than its factorization.
3013203210220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1266051802 (or 1266051800 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 3013203210220 its reverse (220123023103), we get a palindrome (3233326233323).
The spelling of 3013203210220 in words is "three trillion, thirteen billion, two hundred three million, two hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •