Base | Representation |
---|---|
bin | 1000010000001… |
… | …0011100011111 |
3 | 2102010112010211 |
4 | 2010002130133 |
5 | 32330104043 |
6 | 3233513251 |
7 | 600130414 |
oct | 204023437 |
9 | 72115124 |
10 | 34613023 |
11 | 185a1305 |
12 | b712827 |
13 | 722b8a3 |
14 | 485010b |
15 | 308aa9d |
hex | 210271f |
34613023 has 4 divisors (see below), whose sum is σ = 35087248. Its totient is φ = 34138800.
The previous prime is 34613021. The next prime is 34613027. The reversal of 34613023 is 32031643.
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 34613023 - 21 = 34613021 is a prime.
It is a super-2 number, since 2×346130232 = 2396122722397058, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 34612985 and 34613003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34613021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 237003 + ... + 237148.
It is an arithmetic number, because the mean of its divisors is an integer number (8771812).
Almost surely, 234613023 is an apocalyptic number.
34613023 is a deficient number, since it is larger than the sum of its proper divisors (474225).
34613023 is an equidigital number, since it uses as much as digits as its factorization.
34613023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 474224.
The product of its (nonzero) digits is 1296, while the sum is 22.
The square root of 34613023 is about 5883.2833520068. The cubic root of 34613023 is about 325.8966105452.
Adding to 34613023 its reverse (32031643), we get a palindrome (66644666).
The spelling of 34613023 in words is "thirty-four million, six hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •