Base | Representation |
---|---|
bin | 111110001000110100… |
… | …1100110010000011111 |
3 | 110202102200002121101220 |
4 | 1330101221212100133 |
5 | 4141241131302310 |
6 | 141145044304423 |
7 | 12432525110331 |
oct | 1742151462037 |
9 | 422380077356 |
10 | 133440103455 |
11 | 5165650683a |
12 | 21a409a2113 |
13 | c7777cc2c9 |
14 | 665c315451 |
15 | 370ed8d670 |
hex | 1f11a6641f |
133440103455 has 16 divisors (see below), whose sum is σ = 215577024000. Its totient is φ = 70477102368.
The previous prime is 133440103451. The next prime is 133440103457. The reversal of 133440103455 is 554301044331.
It is not a de Polignac number, because 133440103455 - 22 = 133440103451 is a prime.
It is a super-2 number, since 2×1334401034552 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133440103451) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 43182955 + ... + 43186044.
It is an arithmetic number, because the mean of its divisors is an integer number (13473564000).
Almost surely, 2133440103455 is an apocalyptic number.
133440103455 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
133440103455 is a deficient number, since it is larger than the sum of its proper divisors (82136920545).
133440103455 is a wasteful number, since it uses less digits than its factorization.
133440103455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86369110.
The product of its (nonzero) digits is 43200, while the sum is 33.
Adding to 133440103455 its reverse (554301044331), we get a palindrome (687741147786).
The spelling of 133440103455 in words is "one hundred thirty-three billion, four hundred forty million, one hundred three thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •