Base | Representation |
---|---|
bin | 111110100011111100… |
… | …0111110100111001000 |
3 | 110211210002102110220000 |
4 | 1331013320332213020 |
5 | 4200122111330112 |
6 | 141415233003000 |
7 | 12464215023213 |
oct | 1750770764710 |
9 | 424702373800 |
10 | 134350105032 |
11 | 51a8314a460 |
12 | 220556b3460 |
13 | c8911b8190 |
14 | 670711677a |
15 | 3764be37dc |
hex | 1f47e3e9c8 |
134350105032 has 160 divisors (see below), whose sum is σ = 442092530880. Its totient is φ = 37580423040.
The previous prime is 134350105007. The next prime is 134350105033. The reversal of 134350105032 is 230501053431.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 134350104987 and 134350105005.
It is not an unprimeable number, because it can be changed into a prime (134350105033) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 632268 + ... + 817595.
It is an arithmetic number, because the mean of its divisors is an integer number (2763078318).
Almost surely, 2134350105032 is an apocalyptic number.
134350105032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
134350105032 is an abundant number, since it is smaller than the sum of its proper divisors (307742425848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134350105032 is a wasteful number, since it uses less digits than its factorization.
134350105032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1449905 (or 1449892 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
Adding to 134350105032 its reverse (230501053431), we get a palindrome (364851158463).
The spelling of 134350105032 in words is "one hundred thirty-four billion, three hundred fifty million, one hundred five thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •