Base | Representation |
---|---|
bin | 100010100110111000111001… |
… | …0111010101010101101110011 |
3 | 1110220211111122202212200102022 |
4 | 1011031301302322222231303 |
5 | 304344441314143200420 |
6 | 2555232542300142055 |
7 | 121056020612240546 |
oct | 10515616272525563 |
9 | 1426744582780368 |
10 | 304412030053235 |
11 | 88aa4464a61545 |
12 | 2a185110b3792b |
13 | 100b1c14c96680 |
14 | 552589993a85d |
15 | 252d6c741cc25 |
hex | 114dc72eaab73 |
304412030053235 has 32 divisors (see below), whose sum is σ = 403006998481920. Its totient is φ = 219303928857600.
The previous prime is 304412030053231. The next prime is 304412030053259. The reversal of 304412030053235 is 532350030214403.
It is not a de Polignac number, because 304412030053235 - 22 = 304412030053231 is a prime.
It is a super-2 number, since 2×3044120300532352 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 304412030053195 and 304412030053204.
It is not an unprimeable number, because it can be changed into a prime (304412030053231) 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, 57338030 + ... + 62421740.
It is an arithmetic number, because the mean of its divisors is an integer number (12593968702560).
Almost surely, 2304412030053235 is an apocalyptic number.
304412030053235 is a deficient number, since it is larger than the sum of its proper divisors (98594968428685).
304412030053235 is a wasteful number, since it uses less digits than its factorization.
304412030053235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5106239.
The product of its (nonzero) digits is 129600, while the sum is 35.
Adding to 304412030053235 its reverse (532350030214403), we get a palindrome (836762060267638).
The spelling of 304412030053235 in words is "three hundred four trillion, four hundred twelve billion, thirty million, fifty-three thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •