Base | Representation |
---|---|
bin | 10000011111111001001100… |
… | …01110001101110111011011 |
3 | 11202110100121121102210201212 |
4 | 20033330212032031313123 |
5 | 14223403402340312311 |
6 | 205054524011533335 |
7 | 10433105630604146 |
oct | 1017744616156733 |
9 | 152410547383655 |
10 | 36280230010331 |
11 | 106183a502096a |
12 | 409b42775a24b |
13 | 1732298786bb8 |
14 | 8d5d8878b05d |
15 | 42daea98ac8b |
hex | 20ff2638dddb |
36280230010331 has 8 divisors (see below), whose sum is σ = 37860214571424. Its totient is φ = 34700460720640.
The previous prime is 36280230010327. The next prime is 36280230010351. The reversal of 36280230010331 is 13301003208263.
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 36280230010331 - 22 = 36280230010327 is a prime.
It is a super-2 number, since 2×362802300103312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (36280230010351) 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, 53473400 + ... + 54147621.
It is an arithmetic number, because the mean of its divisors is an integer number (4732526821428).
Almost surely, 236280230010331 is an apocalyptic number.
36280230010331 is a deficient number, since it is larger than the sum of its proper divisors (1579984561093).
36280230010331 is a wasteful number, since it uses less digits than its factorization.
36280230010331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107635701.
The product of its (nonzero) digits is 15552, while the sum is 32.
Adding to 36280230010331 its reverse (13301003208263), we get a palindrome (49581233218594).
The spelling of 36280230010331 in words is "thirty-six trillion, two hundred eighty billion, two hundred thirty million, ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •