Base | Representation |
---|---|
bin | 11110001111110000011100… |
… | …110110000010111010010100 |
3 | 122102222222201222120212221110 |
4 | 132033300130312002322110 |
5 | 114413432041010141320 |
6 | 1150530251235415020 |
7 | 40006452646226133 |
oct | 3617603466027224 |
9 | 572888658525843 |
10 | 133024211021460 |
11 | 39427284207750 |
12 | 12b04b97154470 |
13 | 592c18b027195 |
14 | 24bc59874191a |
15 | 105a3e95b35e0 |
hex | 78fc1cd82e94 |
133024211021460 has 96 divisors (see below), whose sum is σ = 406489681713024. Its totient is φ = 32235501312000.
The previous prime is 133024211021459. The next prime is 133024211021477. The reversal of 133024211021460 is 64120112420331.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 38310721 + ... + 41638440.
It is an arithmetic number, because the mean of its divisors is an integer number (4234267517844).
Almost surely, 2133024211021460 is an apocalyptic number.
133024211021460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133024211021460 is an abundant number, since it is smaller than the sum of its proper divisors (273465470691564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133024211021460 is a wasteful number, since it uses less digits than its factorization.
133024211021460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79951705 (or 79951703 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 30.
Adding to 133024211021460 its reverse (64120112420331), we get a palindrome (197144323441791).
The spelling of 133024211021460 in words is "one hundred thirty-three trillion, twenty-four billion, two hundred eleven million, twenty-one thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •