Base | Representation |
---|---|
bin | 11111010000111000… |
… | …111111000000100001 |
3 | 10012122111200200201101 |
4 | 133100320333000201 |
5 | 1022222224321040 |
6 | 23231020034401 |
7 | 2265610636543 |
oct | 372070770041 |
9 | 105574620641 |
10 | 33569370145 |
11 | 13267041713 |
12 | 660a392a01 |
13 | 321ca0c63c |
14 | 18a6503693 |
15 | d1718a09a |
hex | 7d0e3f021 |
33569370145 has 24 divisors (see below), whose sum is σ = 42928007616. Its totient is φ = 25194899232.
The previous prime is 33569370077. The next prime is 33569370217. The reversal of 33569370145 is 54107396533.
It is not a de Polignac number, because 33569370145 - 27 = 33569370017 is a prime.
It is a super-2 number, since 2×335693701452 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 33569370095 and 33569370104.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 95634 + ... + 276196.
It is an arithmetic number, because the mean of its divisors is an integer number (1788666984).
Almost surely, 233569370145 is an apocalyptic number.
It is an amenable number.
33569370145 is a deficient number, since it is larger than the sum of its proper divisors (9358637471).
33569370145 is a wasteful number, since it uses less digits than its factorization.
33569370145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180709 (or 180690 counting only the distinct ones).
The product of its (nonzero) digits is 1020600, while the sum is 46.
The spelling of 33569370145 in words is "thirty-three billion, five hundred sixty-nine million, three hundred seventy thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •