Base | Representation |
---|---|
bin | 10100010101101… |
… | …011011111001101 |
3 | 212210002011002102 |
4 | 110111223133031 |
5 | 1144323234334 |
6 | 53505404445 |
7 | 11312246162 |
oct | 2425533715 |
9 | 783064072 |
10 | 341227469 |
11 | 165683280 |
12 | 96339725 |
13 | 5590425b |
14 | 33466069 |
15 | 1ee5467e |
hex | 1456b7cd |
341227469 has 4 divisors (see below), whose sum is σ = 372248160. Its totient is φ = 310206780.
The previous prime is 341227463. The next prime is 341227493. The reversal of 341227469 is 964722143.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-341227469 is a prime.
It is a super-2 number, since 2×3412274692 = 232872371200291922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (341227463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15510329 + ... + 15510350.
It is an arithmetic number, because the mean of its divisors is an integer number (93062040).
Almost surely, 2341227469 is an apocalyptic number.
It is an amenable number.
341227469 is a deficient number, since it is larger than the sum of its proper divisors (31020691).
341227469 is a wasteful number, since it uses less digits than its factorization.
341227469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31020690.
The product of its digits is 72576, while the sum is 38.
The square root of 341227469 is about 18472.3433543230. The cubic root of 341227469 is about 698.7921135264.
The spelling of 341227469 in words is "three hundred forty-one million, two hundred twenty-seven thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •