Base | Representation |
---|---|
bin | 110001101011110100001… |
… | …110101001010101010001 |
3 | 110002101220112122210011010 |
4 | 301223310032221111101 |
5 | 421414442141404131 |
6 | 11132301454441133 |
7 | 501450401004306 |
oct | 61536416512521 |
9 | 13071815583133 |
10 | 3414301513041 |
11 | 10a6aa7214541 |
12 | 47186a8031a9 |
13 | 1b9c760877a3 |
14 | bb37861b0ad |
15 | 5dc3197cb46 |
hex | 31af43a9551 |
3414301513041 has 16 divisors (see below), whose sum is σ = 4820956056000. Its totient is φ = 2141966527488.
The previous prime is 3414301513039. The next prime is 3414301513043. The reversal of 3414301513041 is 1403151034143.
3414301513041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (3414301513039) and next prime (3414301513043).
It is not a de Polignac number, because 3414301513041 - 21 = 3414301513039 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3414301513043) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4992856 + ... + 5635353.
It is an arithmetic number, because the mean of its divisors is an integer number (301309753500).
Almost surely, 23414301513041 is an apocalyptic number.
It is an amenable number.
3414301513041 is a deficient number, since it is larger than the sum of its proper divisors (1406654542959).
3414301513041 is a wasteful number, since it uses less digits than its factorization.
3414301513041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10634528.
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 3414301513041 its reverse (1403151034143), we get a palindrome (4817452547184).
The spelling of 3414301513041 in words is "three trillion, four hundred fourteen billion, three hundred one million, five hundred thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •