Base | Representation |
---|---|
bin | 11111110000100010… |
… | …110100010110010111 |
3 | 10021000111222100012110 |
4 | 133300202310112113 |
5 | 1024314202231411 |
6 | 23355430322103 |
7 | 2315016605640 |
oct | 376042642627 |
9 | 107014870173 |
10 | 34100430231 |
11 | 13509892a4a |
12 | 67381b9333 |
13 | 32a5a4b08a |
14 | 1916c626c7 |
15 | d48adb2a6 |
hex | 7f08b4597 |
34100430231 has 64 divisors (see below), whose sum is σ = 53265235968. Its totient is φ = 19005401088.
The previous prime is 34100430211. The next prime is 34100430241. The reversal of 34100430231 is 13203400143.
It is not a de Polignac number, because 34100430231 - 26 = 34100430167 is a prime.
It is a super-2 number, since 2×341004302312 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 34100430198 and 34100430207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34100430211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 56178330 + ... + 56178936.
It is an arithmetic number, because the mean of its divisors is an integer number (832269312).
Almost surely, 234100430231 is an apocalyptic number.
34100430231 is a deficient number, since it is larger than the sum of its proper divisors (19164805737).
34100430231 is a wasteful number, since it uses less digits than its factorization.
34100430231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1060.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 34100430231 its reverse (13203400143), we get a palindrome (47303830374).
The spelling of 34100430231 in words is "thirty-four billion, one hundred million, four hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •