Base | Representation |
---|---|
bin | 111110001011001101… |
… | …1101110000011100000 |
3 | 110202122021002121222002 |
4 | 1330112123232003200 |
5 | 4141422202221311 |
6 | 141201032303132 |
7 | 12434521155452 |
oct | 1742633560340 |
9 | 422567077862 |
10 | 133520351456 |
11 | 516978372a8 |
12 | 21a63841aa8 |
13 | c78b31852b |
14 | 6668c442d2 |
15 | 3716e4093b |
hex | 1f166ee0e0 |
133520351456 has 24 divisors (see below), whose sum is σ = 274297245264. Its totient is φ = 63857559040.
The previous prime is 133520351413. The next prime is 133520351467. The reversal of 133520351456 is 654153025331.
It is a super-2 number, since 2×1335203514562 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 90706025 + ... + 90707496.
It is an arithmetic number, because the mean of its divisors is an integer number (11429051886).
Almost surely, 2133520351456 is an apocalyptic number.
133520351456 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
133520351456 is an abundant number, since it is smaller than the sum of its proper divisors (140776893808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133520351456 is a wasteful number, since it uses less digits than its factorization.
133520351456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181413554 (or 181413546 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 38.
Adding to 133520351456 its reverse (654153025331), we get a palindrome (787673376787).
The spelling of 133520351456 in words is "one hundred thirty-three billion, five hundred twenty million, three hundred fifty-one thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •