Base | Representation |
---|---|
bin | 110001101011101010101… |
… | …010101110000010110110 |
3 | 110002101111100210222010022 |
4 | 301223222222232002312 |
5 | 421414130110201324 |
6 | 11132233524325142 |
7 | 501443412345365 |
oct | 61535252560266 |
9 | 13071440728108 |
10 | 3414141100214 |
11 | 10a6a2470aa59 |
12 | 471824b437b2 |
13 | 1b9c4ba81160 |
14 | bb3611c17dc |
15 | 5dc2284305e |
hex | 31aeaaae0b6 |
3414141100214 has 8 divisors (see below), whose sum is σ = 5515151008080. Its totient is φ = 1575757430856.
The previous prime is 3414141100211. The next prime is 3414141100261. The reversal of 3414141100214 is 4120011414143.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 131313119239 = 3414141100214 / (3 + 4 + 1 + 4 + 1 + 4 + 1 + 1 + 0 + 0 + 2 + 1 + 4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3414141100211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 65656559594 + ... + 65656559645.
It is an arithmetic number, because the mean of its divisors is an integer number (689393876010).
Almost surely, 23414141100214 is an apocalyptic number.
3414141100214 is a deficient number, since it is larger than the sum of its proper divisors (2101009907866).
3414141100214 is a wasteful number, since it uses less digits than its factorization.
3414141100214 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131313119254.
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 3414141100214 its reverse (4120011414143), we get a palindrome (7534152514357).
The spelling of 3414141100214 in words is "three trillion, four hundred fourteen billion, one hundred forty-one million, one hundred thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •