Base | Representation |
---|---|
bin | 111110011101011000… |
… | …1011101101101000111 |
3 | 110211012202022120122220 |
4 | 1330322301131231013 |
5 | 4144144242001211 |
6 | 141341332023423 |
7 | 12455603312214 |
oct | 1747261355507 |
9 | 424182276586 |
10 | 134130031431 |
11 | 5197a9a6950 |
12 | 21bb3a61b73 |
13 | c857723106 |
14 | 66c5bcab0b |
15 | 3750721806 |
hex | 1f3ac5db47 |
134130031431 has 32 divisors (see below), whose sum is σ = 203824373760. Its totient is φ = 77663493600.
The previous prime is 134130031429. The next prime is 134130031457.
134130031431 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 134130031431 - 21 = 134130031429 is a prime.
It is a super-2 number, since 2×1341300314312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134130031481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 531486 + ... + 742116.
It is an arithmetic number, because the mean of its divisors is an integer number (6369511680).
Almost surely, 2134130031431 is an apocalyptic number.
134130031431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
134130031431 is a deficient number, since it is larger than the sum of its proper divisors (69694342329).
134130031431 is a wasteful number, since it uses less digits than its factorization.
134130031431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211507.
The product of its (nonzero) digits is 1296, while the sum is 24.
It can be divided in two parts, 1341300 and 31431, that added together give a palindrome (1372731).
The spelling of 134130031431 in words is "one hundred thirty-four billion, one hundred thirty million, thirty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •