Base | Representation |
---|---|
bin | 1000110010101000011… |
… | …11110110110010100001 |
3 | 1001212200011100110201110 |
4 | 10121110033312302201 |
5 | 14422110123402231 |
6 | 350433122453533 |
7 | 30552233304135 |
oct | 4312417666241 |
9 | 1055604313643 |
10 | 302061153441 |
11 | 1071157123a3 |
12 | 4a65b8042a9 |
13 | 2263ab67c28 |
14 | 10896b993c5 |
15 | 7ccd601046 |
hex | 46543f6ca1 |
302061153441 has 8 divisors (see below), whose sum is σ = 412114442080. Its totient is φ = 196690983552.
The previous prime is 302061153419. The next prime is 302061153451. The reversal of 302061153441 is 144351160203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 302061153441 - 26 = 302061153377 is a prime.
It is a super-2 number, since 2×3020611534412 (a number of 24 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 = 302061153399 and 302061153408.
It is not an unprimeable number, because it can be changed into a prime (302061153451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1170779536 + ... + 1170779793.
It is an arithmetic number, because the mean of its divisors is an integer number (51514305260).
Almost surely, 2302061153441 is an apocalyptic number.
It is an amenable number.
302061153441 is a deficient number, since it is larger than the sum of its proper divisors (110053288639).
302061153441 is a wasteful number, since it uses less digits than its factorization.
302061153441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2341559375.
The product of its (nonzero) digits is 8640, while the sum is 30.
The spelling of 302061153441 in words is "three hundred two billion, sixty-one million, one hundred fifty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •