Base | Representation |
---|---|
bin | 111110110111101111… |
… | …0010011100011010001 |
3 | 110220111101001002001110 |
4 | 1331233132103203101 |
5 | 4203002113422203 |
6 | 142005154523533 |
7 | 12516530530530 |
oct | 1755736234321 |
9 | 426441032043 |
10 | 135014201553 |
11 | 52293aa6a60 |
12 | 221bbb965a9 |
13 | c9689664ba |
14 | 676b3c6317 |
15 | 37a3172d03 |
hex | 1f6f7938d1 |
135014201553 has 32 divisors (see below), whose sum is σ = 224544264192. Its totient is φ = 70104412800.
The previous prime is 135014201507. The next prime is 135014201557. The reversal of 135014201553 is 355102410531.
It is not a de Polignac number, because 135014201553 - 212 = 135014197457 is a prime.
It is a super-2 number, since 2×1350142015532 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 135014201553.
It is not an unprimeable number, because it can be changed into a prime (135014201557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 361608 + ... + 633078.
It is an arithmetic number, because the mean of its divisors is an integer number (7017008256).
Almost surely, 2135014201553 is an apocalyptic number.
It is an amenable number.
135014201553 is a deficient number, since it is larger than the sum of its proper divisors (89530062639).
135014201553 is a wasteful number, since it uses less digits than its factorization.
135014201553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273645.
The product of its (nonzero) digits is 9000, while the sum is 30.
The spelling of 135014201553 in words is "one hundred thirty-five billion, fourteen million, two hundred one thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •