Base | Representation |
---|---|
bin | 101100001001111100111… |
… | …100110111011010111001 |
3 | 101202002011121010200221212 |
4 | 230021330330313122321 |
5 | 344203313332211101 |
6 | 10241542534212505 |
7 | 432136565664233 |
oct | 54117474673271 |
9 | 11662147120855 |
10 | 3034343241401 |
11 | a6a94872230a |
12 | 4100ab4b4135 |
13 | 1901a2974514 |
14 | a6c120c3253 |
15 | 53de47e41bb |
hex | 2c27cf376b9 |
3034343241401 has 8 divisors (see below), whose sum is σ = 3100943049600. Its totient is φ = 2968448193360.
The previous prime is 3034343241389. The next prime is 3034343241431. The reversal of 3034343241401 is 1041423434303.
3034343241401 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3034343241401 - 210 = 3034343240377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3034343241431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 176181335 + ... + 176198556.
It is an arithmetic number, because the mean of its divisors is an integer number (387617881200).
Almost surely, 23034343241401 is an apocalyptic number.
It is an amenable number.
3034343241401 is a deficient number, since it is larger than the sum of its proper divisors (66599808199).
3034343241401 is a wasteful number, since it uses less digits than its factorization.
3034343241401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352380079.
The product of its (nonzero) digits is 41472, while the sum is 32.
Adding to 3034343241401 its reverse (1041423434303), we get a palindrome (4075766675704).
The spelling of 3034343241401 in words is "three trillion, thirty-four billion, three hundred forty-three million, two hundred forty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •