Base | Representation |
---|---|
bin | 11110100010100000001011… |
… | …000110000101000010101101 |
3 | 122121120010210022212012200010 |
4 | 132202200023012011002231 |
5 | 120101033300234022110 |
6 | 1153354133305323433 |
7 | 40201515365044434 |
oct | 3642401306050255 |
9 | 577503708765603 |
10 | 134312403423405 |
11 | 39883630240739 |
12 | 13092788196579 |
13 | 59c37b3ab38bc |
14 | 2524a7da7411b |
15 | 107db91ac1020 |
hex | 7a280b1850ad |
134312403423405 has 32 divisors (see below), whose sum is σ = 215998268035968. Its totient is φ = 71267166432000.
The previous prime is 134312403423343. The next prime is 134312403423413. The reversal of 134312403423405 is 504324304213431.
It is not a de Polignac number, because 134312403423405 - 29 = 134312403422893 is a prime.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 85212510 + ... + 86774400.
It is an arithmetic number, because the mean of its divisors is an integer number (6749945876124).
Almost surely, 2134312403423405 is an apocalyptic number.
134312403423405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
134312403423405 is a deficient number, since it is larger than the sum of its proper divisors (81685864612563).
134312403423405 is a wasteful number, since it uses less digits than its factorization.
134312403423405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1591197.
The product of its (nonzero) digits is 414720, while the sum is 39.
Adding to 134312403423405 its reverse (504324304213431), we get a palindrome (638636707636836).
The spelling of 134312403423405 in words is "one hundred thirty-four trillion, three hundred twelve billion, four hundred three million, four hundred twenty-three thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •