Base | Representation |
---|---|
bin | 111110111000111001… |
… | …0011101101101000010 |
3 | 110220121002010022000010 |
4 | 1331301302131231002 |
5 | 4203042034243300 |
6 | 142013103205350 |
7 | 12520511621466 |
oct | 1756162355502 |
9 | 426532108003 |
10 | 135053040450 |
11 | 52303a14219 |
12 | 22210ba6856 |
13 | c973a146b3 |
14 | 67726164a6 |
15 | 37a6795a50 |
hex | 1f71c9db42 |
135053040450 has 96 divisors (see below), whose sum is σ = 342527380416. Its totient is φ = 35206133760.
The previous prime is 135053040413. The next prime is 135053040461. The reversal of 135053040450 is 54040350531.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1182777 + ... + 1291923.
It is an arithmetic number, because the mean of its divisors is an integer number (3567993546).
Almost surely, 2135053040450 is an apocalyptic number.
135053040450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 135053040450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (171263690208).
135053040450 is an abundant number, since it is smaller than the sum of its proper divisors (207474339966).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135053040450 is a wasteful number, since it uses less digits than its factorization.
135053040450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109348 (or 109343 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 30.
Adding to 135053040450 its reverse (54040350531), we get a palindrome (189093390981).
The spelling of 135053040450 in words is "one hundred thirty-five billion, fifty-three million, forty thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •