Base | Representation |
---|---|
bin | 11110001111100101011000… |
… | …101100101111100101110100 |
3 | 122102221212001222221102022221 |
4 | 132033211120230233211310 |
5 | 114413233223030022400 |
6 | 1150521004310532124 |
7 | 40005552353666266 |
oct | 3617453054574564 |
9 | 572855058842287 |
10 | 133012330314100 |
11 | 39422237924436 |
12 | 12b02820367044 |
13 | 592b0167cc623 |
14 | 24bbb8c8d7b36 |
15 | 1059e51558c1a |
hex | 78f958b2f974 |
133012330314100 has 72 divisors (see below), whose sum is σ = 309560772155040. Its totient is φ = 49453640945280.
The previous prime is 133012330314077. The next prime is 133012330314131. The reversal of 133012330314100 is 1413033210331.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 660337882 + ... + 660539281.
It is an arithmetic number, because the mean of its divisors is an integer number (4299455168820).
Almost surely, 2133012330314100 is an apocalyptic number.
133012330314100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133012330314100 is an abundant number, since it is smaller than the sum of its proper divisors (176548441840940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133012330314100 is a wasteful number, since it uses less digits than its factorization.
133012330314100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1320877249 (or 1320877242 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 133012330314100 its reverse (1413033210331), we get a palindrome (134425363524431).
The spelling of 133012330314100 in words is "one hundred thirty-three trillion, twelve billion, three hundred thirty million, three hundred fourteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •