Base | Representation |
---|---|
bin | 100010101110111101110010… |
… | …0111001111000011001111000 |
3 | 1111001202121210112222021022100 |
4 | 1011131323210321320121320 |
5 | 310021133121231342102 |
6 | 3001442520035423400 |
7 | 121232145031225602 |
oct | 10535734471703170 |
9 | 1431677715867270 |
10 | 305522044012152 |
11 | 893921979a1040 |
12 | 2a324276454b60 |
13 | 101627b3608906 |
14 | 55634bad5c172 |
15 | 254c4e20d7a1c |
hex | 115dee4e78678 |
305522044012152 has 48 divisors (see below), whose sum is σ = 902678766401880. Its totient is φ = 92582437579200.
The previous prime is 305522044012067. The next prime is 305522044012261. The reversal of 305522044012152 is 251210440225503.
305522044012152 is a `hidden beast` number, since 3 + 0 + 5 + 5 + 220 + 4 + 401 + 21 + 5 + 2 = 666.
It is a super-2 number, since 2×3055220440121522 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 192880077499 + ... + 192880079082.
Almost surely, 2305522044012152 is an apocalyptic number.
It is an amenable number.
305522044012152 is an abundant number, since it is smaller than the sum of its proper divisors (597156722389728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
305522044012152 is a wasteful number, since it uses less digits than its factorization.
305522044012152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385760156604 (or 385760156597 counting only the distinct ones).
The product of its (nonzero) digits is 96000, while the sum is 36.
Adding to 305522044012152 its reverse (251210440225503), we get a palindrome (556732484237655).
The spelling of 305522044012152 in words is "three hundred five trillion, five hundred twenty-two billion, forty-four million, twelve thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •