Base | Representation |
---|---|
bin | 1000110010111110010… |
… | …10111011111111011001 |
3 | 1001220010221012001010101 |
4 | 10121133022323333121 |
5 | 14422444032212101 |
6 | 350503230415401 |
7 | 30556620060550 |
oct | 4313712737731 |
9 | 1056127161111 |
10 | 302244413401 |
11 | 1071aa101307 |
12 | 4a6b1061561 |
13 | 22669b10888 |
14 | 108b3260d97 |
15 | 7cde750401 |
hex | 465f2bbfd9 |
302244413401 has 8 divisors (see below), whose sum is σ = 353847118464. Its totient is φ = 252747941280.
The previous prime is 302244413381. The next prime is 302244413411. The reversal of 302244413401 is 104314442203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 302244413401 - 25 = 302244413369 is a prime.
It is a super-2 number, since 2×3022444134012 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 302244413401.
It is not an unprimeable number, because it can be changed into a prime (302244413411) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 526557925 + ... + 526558498.
It is an arithmetic number, because the mean of its divisors is an integer number (44230889808).
Almost surely, 2302244413401 is an apocalyptic number.
It is an amenable number.
302244413401 is a deficient number, since it is larger than the sum of its proper divisors (51602705063).
302244413401 is a wasteful number, since it uses less digits than its factorization.
302244413401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1053116471.
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 302244413401 its reverse (104314442203), we get a palindrome (406558855604).
The spelling of 302244413401 in words is "three hundred two billion, two hundred forty-four million, four hundred thirteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •