Base | Representation |
---|---|
bin | 1000001001001… |
… | …0011011101111 |
3 | 2101021012210020 |
4 | 2002102123233 |
5 | 32220413343 |
6 | 3220013223 |
7 | 563206665 |
oct | 202223357 |
9 | 71235706 |
10 | 34154223 |
11 | 18308634 |
12 | b531213 |
13 | 70caacc |
14 | 4770c35 |
15 | 2ee9b83 |
hex | 20926ef |
34154223 has 4 divisors (see below), whose sum is σ = 45538968. Its totient is φ = 22769480.
The previous prime is 34154221. The next prime is 34154233. The reversal of 34154223 is 32245143.
34154223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 34154223 - 21 = 34154221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 34154193 and 34154202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34154221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5692368 + ... + 5692373.
It is an arithmetic number, because the mean of its divisors is an integer number (11384742).
Almost surely, 234154223 is an apocalyptic number.
34154223 is a deficient number, since it is larger than the sum of its proper divisors (11384745).
34154223 is a wasteful number, since it uses less digits than its factorization.
34154223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11384744.
The product of its digits is 2880, while the sum is 24.
The square root of 34154223 is about 5844.1614454086. The cubic root of 34154223 is about 324.4502675044.
Adding to 34154223 its reverse (32245143), we get a palindrome (66399366).
The spelling of 34154223 in words is "thirty-four million, one hundred fifty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •