Base | Representation |
---|---|
bin | 11110100101011001100110… |
… | …011001101111110111010010 |
3 | 122122021011200222100101100012 |
4 | 132211121212121233313102 |
5 | 120112314024433124220 |
6 | 1154025422021354522 |
7 | 40222064313250112 |
oct | 3645314631576722 |
9 | 578234628311305 |
10 | 134511503801810 |
11 | 39950010208913 |
12 | 13105292568a42 |
13 | 5a094c390c6b5 |
14 | 253056a497042 |
15 | 1083e46090ac5 |
hex | 7a566666fdd2 |
134511503801810 has 16 divisors (see below), whose sum is σ = 248026089937752. Its totient is φ = 52492294166400.
The previous prime is 134511503801803. The next prime is 134511503801833. The reversal of 134511503801810 is 18108305115431.
134511503801810 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 62254924652041 + 72256579149769 = 7890179^2 + 8500387^2 .
It is a super-2 number, since 2×1345115038018102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 164038418861 + ... + 164038419680.
Almost surely, 2134511503801810 is an apocalyptic number.
134511503801810 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
134511503801810 is a deficient number, since it is larger than the sum of its proper divisors (113514586135942).
134511503801810 is a wasteful number, since it uses less digits than its factorization.
134511503801810 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 328076838589.
The product of its (nonzero) digits is 57600, while the sum is 41.
The spelling of 134511503801810 in words is "one hundred thirty-four trillion, five hundred eleven billion, five hundred three million, eight hundred one thousand, eight hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •