Base | Representation |
---|---|
bin | 101100001001110100101… |
… | …010101000000001010000 |
3 | 101202001210220120210121220 |
4 | 230021310222220001100 |
5 | 344203022241221000 |
6 | 10241521051045040 |
7 | 432133260342201 |
oct | 54116452500120 |
9 | 11661726523556 |
10 | 3034204242000 |
11 | a6a887213a78 |
12 | 410070a40780 |
13 | 19017cc27759 |
14 | a6bdb85d5a8 |
15 | 53dd74d91a0 |
hex | 2c274aa8050 |
3034204242000 has 80 divisors (see below), whose sum is σ = 9782274495552. Its totient is φ = 809121129600.
The previous prime is 3034204241989. The next prime is 3034204242011. The reversal of 3034204242000 is 2424024303.
It is an interprime number because it is at equal distance from previous prime (3034204241989) and next prime (3034204242011).
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 252844354 + ... + 252856353.
Almost surely, 23034204242000 is an apocalyptic number.
3034204242000 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3034204242000 is an abundant number, since it is smaller than the sum of its proper divisors (6748070253552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3034204242000 is a wasteful number, since it uses less digits than its factorization.
3034204242000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505700733 (or 505700717 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 24.
Adding to 3034204242000 its reverse (2424024303), we get a palindrome (3036628266303).
The spelling of 3034204242000 in words is "three trillion, thirty-four billion, two hundred four million, two hundred forty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •