Base | Representation |
---|---|
bin | 101100010000001001101… |
… | …110011011110011011111 |
3 | 101202201100112000201220222 |
4 | 230100021232123303133 |
5 | 344310432000404043 |
6 | 10245003252031555 |
7 | 432463546421540 |
oct | 54201156336337 |
9 | 11681315021828 |
10 | 3041000013023 |
11 | a72754257365 |
12 | 4114489025bb |
13 | 1909c3b2553b |
14 | a72842164c7 |
15 | 54183e10d68 |
hex | 2c409b9bcdf |
3041000013023 has 8 divisors (see below), whose sum is σ = 3475539207840. Its totient is φ = 2606488473600.
The previous prime is 3041000012929. The next prime is 3041000013041. The reversal of 3041000013023 is 3203100001403.
It is a happy number.
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 3041000013023 - 28 = 3041000012767 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3041000012992 and 3041000013010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3041000043023) 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 7 ways as a sum of consecutive naturals, for example, 6677678 + ... + 7118523.
It is an arithmetic number, because the mean of its divisors is an integer number (434442400980).
Almost surely, 23041000013023 is an apocalyptic number.
3041000013023 is a deficient number, since it is larger than the sum of its proper divisors (434539194817).
3041000013023 is a wasteful number, since it uses less digits than its factorization.
3041000013023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13827697.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 3041000013023 its reverse (3203100001403), we get a palindrome (6244100014426).
The spelling of 3041000013023 in words is "three trillion, forty-one billion, thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •