Base | Representation |
---|---|
bin | 101011110011101011000… |
… | …101100100110010000110 |
3 | 101122210102102121211000200 |
4 | 223303223011210302012 |
5 | 343310320312324332 |
6 | 10222545102151330 |
7 | 430332021055143 |
oct | 53635305446206 |
9 | 11583372554020 |
10 | 3010421214342 |
11 | a60792326313 |
12 | 407533b82546 |
13 | 18ab5c878a19 |
14 | a59c2d833ca |
15 | 534945a617c |
hex | 2bceb164c86 |
3010421214342 has 48 divisors (see below), whose sum is σ = 6573978378240. Its totient is φ = 995576022000.
The previous prime is 3010421214341. The next prime is 3010421214373. The reversal of 3010421214342 is 2434121240103.
3010421214342 is a `hidden beast` number, since 3 + 0 + 10 + 4 + 212 + 1 + 434 + 2 = 666.
3010421214342 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3010421214341) 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, 3271467 + ... + 4089417.
It is an arithmetic number, because the mean of its divisors is an integer number (136957882880).
Almost surely, 23010421214342 is an apocalyptic number.
3010421214342 is an abundant number, since it is smaller than the sum of its proper divisors (3563557163898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3010421214342 is a wasteful number, since it uses less digits than its factorization.
3010421214342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 819569 (or 819566 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 3010421214342 its reverse (2434121240103), we get a palindrome (5444542454445).
The spelling of 3010421214342 in words is "three trillion, ten billion, four hundred twenty-one million, two hundred fourteen thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •