Base | Representation |
---|---|
bin | 100010101110011001111011… |
… | …1111001000011001101100101 |
3 | 1111001111021001221002020111021 |
4 | 1011130303313321003031211 |
5 | 310013402432101300203 |
6 | 3001343304214211141 |
7 | 121223451105546025 |
oct | 10534636771031545 |
9 | 1431437057066437 |
10 | 305445053150053 |
11 | 89362579626893 |
12 | 2a31136a353ab1 |
13 | 10158463a3768b |
14 | 555d895ac7a85 |
15 | 254a4d7db55bd |
hex | 115ccf7e43365 |
305445053150053 has 32 divisors (see below), whose sum is σ = 324417616997760. Its totient is φ = 287083105182720.
The previous prime is 305445053150051. The next prime is 305445053150063. The reversal of 305445053150053 is 350051350544503.
It is a cyclic number.
It is not a de Polignac number, because 305445053150053 - 21 = 305445053150051 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (43).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 305445053149991 and 305445053150009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (305445053150051) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 438979201 + ... + 439674457.
It is an arithmetic number, because the mean of its divisors is an integer number (10138050531180).
Almost surely, 2305445053150053 is an apocalyptic number.
It is an amenable number.
305445053150053 is a deficient number, since it is larger than the sum of its proper divisors (18972563847707).
305445053150053 is a wasteful number, since it uses less digits than its factorization.
305445053150053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 696517.
The product of its (nonzero) digits is 1350000, while the sum is 43.
The spelling of 305445053150053 in words is "three hundred five trillion, four hundred forty-five billion, fifty-three million, one hundred fifty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •