Base | Representation |
---|---|
bin | 111110100011111100… |
… | …0110010000000110111 |
3 | 110211210002022212002212 |
4 | 1331013320302000313 |
5 | 4200122103202211 |
6 | 141415231524035 |
7 | 12464214416606 |
oct | 1750770620067 |
9 | 424702285085 |
10 | 134350053431 |
11 | 51a83114710 |
12 | 2205568961b |
13 | c89119a849 |
14 | 6707101a3d |
15 | 3764bd338b |
hex | 1f47e32037 |
134350053431 has 4 divisors (see below), whose sum is σ = 146563694664. Its totient is φ = 122136412200.
The previous prime is 134350053419. The next prime is 134350053511.
134350053431 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 134350053431 - 214 = 134350037047 is a prime.
It is a super-2 number, since 2×1343500534312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134350053031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6106820600 + ... + 6106820621.
It is an arithmetic number, because the mean of its divisors is an integer number (36640923666).
Almost surely, 2134350053431 is an apocalyptic number.
134350053431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
134350053431 is a deficient number, since it is larger than the sum of its proper divisors (12213641233).
134350053431 is a wasteful number, since it uses less digits than its factorization.
134350053431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12213641232.
The product of its (nonzero) digits is 32400, while the sum is 32.
It can be divided in two parts, 1343500 and 53431, that added together give a palindrome (1396931).
The spelling of 134350053431 in words is "one hundred thirty-four billion, three hundred fifty million, fifty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •