Base | Representation |
---|---|
bin | 101011111100110011111… |
… | …010100111100000111111 |
3 | 101200201202020020211212111 |
4 | 223330303322213200333 |
5 | 343440414122411221 |
6 | 10231250443114451 |
7 | 431130122014063 |
oct | 53746372474077 |
9 | 11621666224774 |
10 | 3020233013311 |
11 | a64967887088 |
12 | 409411b12a27 |
13 | 18ba64580527 |
14 | a6274115aa3 |
15 | 5386ab8abe1 |
hex | 2bf33ea783f |
3020233013311 has 4 divisors (see below), whose sum is σ = 3021847249824. Its totient is φ = 3018618776800.
The previous prime is 3020233013221. The next prime is 3020233013327. The reversal of 3020233013311 is 1133103320203.
3020233013311 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3020233013311 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3020233013341) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 807115450 + ... + 807119191.
It is an arithmetic number, because the mean of its divisors is an integer number (755461812456).
Almost surely, 23020233013311 is an apocalyptic number.
3020233013311 is a deficient number, since it is larger than the sum of its proper divisors (1614236513).
3020233013311 is a wasteful number, since it uses less digits than its factorization.
3020233013311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1614236512.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 3020233013311 its reverse (1133103320203), we get a palindrome (4153336333514).
The spelling of 3020233013311 in words is "three trillion, twenty billion, two hundred thirty-three million, thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •