Base | Representation |
---|---|
bin | 11110011000101110001010… |
… | …101100011101010111001100 |
3 | 122112011212210201010010022002 |
4 | 132120232022230131113030 |
5 | 120004030144441403302 |
6 | 1152121250501011432 |
7 | 40102121406014141 |
oct | 3630561254352714 |
9 | 575155721103262 |
10 | 133640234325452 |
11 | 39644561312738 |
12 | 12ba44580b3b78 |
13 | 59752b2509b4a |
14 | 2500316aa23c8 |
15 | 106b450ecbc02 |
hex | 798b8ab1d5cc |
133640234325452 has 48 divisors (see below), whose sum is σ = 239291237443104. Its totient is φ = 65287339200000.
The previous prime is 133640234325443. The next prime is 133640234325461. The reversal of 133640234325452 is 254523432046331.
133640234325452 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (133640234325443) and next prime (133640234325461).
It is a junction number, because it is equal to n+sod(n) for n = 133640234325397 and 133640234325406.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19918952 + ... + 25769072.
It is an arithmetic number, because the mean of its divisors is an integer number (4985234113398).
Almost surely, 2133640234325452 is an apocalyptic number.
It is an amenable number.
133640234325452 is a deficient number, since it is larger than the sum of its proper divisors (105651003117652).
133640234325452 is a wasteful number, since it uses less digits than its factorization.
133640234325452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5850810 (or 5850808 counting only the distinct ones).
The product of its (nonzero) digits is 6220800, while the sum is 47.
The spelling of 133640234325452 in words is "one hundred thirty-three trillion, six hundred forty billion, two hundred thirty-four million, three hundred twenty-five thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •