Base | Representation |
---|---|
bin | 101100011100011101011… |
… | …110100100011010110101 |
3 | 101210222110120210200122010 |
4 | 230130131132210122311 |
5 | 400020013333101323 |
6 | 10255030530554433 |
7 | 433442220130221 |
oct | 54343536443265 |
9 | 11728416720563 |
10 | 3054216300213 |
11 | a78316529561 |
12 | 413b16a38a19 |
13 | 19201bc64a10 |
14 | a7b795a3781 |
15 | 546a9337c93 |
hex | 2c71d7a46b5 |
3054216300213 has 64 divisors (see below), whose sum is σ = 4756296625920. Its totient is φ = 1727122176000.
The previous prime is 3054216300169. The next prime is 3054216300271. The reversal of 3054216300213 is 3120036124503.
3054216300213 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3054216300213 - 225 = 3054182745781 is a prime.
It is a super-2 number, since 2×30542163002132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3054216300313) 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 63 ways as a sum of consecutive naturals, for example, 4965363 + ... + 5546463.
It is an arithmetic number, because the mean of its divisors is an integer number (74317134780).
Almost surely, 23054216300213 is an apocalyptic number.
It is an amenable number.
3054216300213 is a deficient number, since it is larger than the sum of its proper divisors (1702080325707).
3054216300213 is a wasteful number, since it uses less digits than its factorization.
3054216300213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 581350.
The product of its (nonzero) digits is 12960, while the sum is 30.
The spelling of 3054216300213 in words is "three trillion, fifty-four billion, two hundred sixteen million, three hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •