Base | Representation |
---|---|
bin | 1100101000101000110… |
… | …10010010000110100111 |
3 | 1112111120112221220010000 |
4 | 12110110122102012213 |
5 | 24103101314143421 |
6 | 531234413032343 |
7 | 43236151141152 |
oct | 6242432220647 |
9 | 1474515856100 |
10 | 434134131111 |
11 | 15812a44330a |
12 | 7017a7856b3 |
13 | 31c28358a65 |
14 | 170256b8c99 |
15 | b45d440226 |
hex | 65146921a7 |
434134131111 has 20 divisors (see below), whose sum is σ = 648540882000. Its totient is φ = 289414040256.
The previous prime is 434134131097. The next prime is 434134131139. The reversal of 434134131111 is 111131431434.
434134131111 is a `hidden beast` number, since 4 + 3 + 4 + 1 + 341 + 311 + 1 + 1 = 666.
It is not a de Polignac number, because 434134131111 - 217 = 434134000039 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (434134131191) 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 19 ways as a sum of consecutive naturals, for example, 3730990 + ... + 3845588.
It is an arithmetic number, because the mean of its divisors is an integer number (32427044100).
Almost surely, 2434134131111 is an apocalyptic number.
434134131111 is a deficient number, since it is larger than the sum of its proper divisors (214406750889).
434134131111 is a wasteful number, since it uses less digits than its factorization.
434134131111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161380 (or 161371 counting only the distinct ones).
The product of its digits is 1728, while the sum is 27.
Adding to 434134131111 its reverse (111131431434), we get a palindrome (545265562545).
The spelling of 434134131111 in words is "four hundred thirty-four billion, one hundred thirty-four million, one hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •