Base | Representation |
---|---|
bin | 11001000101100000110110… |
… | …010000100001010111111001 |
3 | 112110122110002111121001021102 |
4 | 121011200312100201113321 |
5 | 103430121400212402223 |
6 | 1030352525520221145 |
7 | 32145040000112510 |
oct | 3105406620412771 |
9 | 473573074531242 |
10 | 110330030200313 |
11 | 32177780828460 |
12 | 1045a847a6a7b5 |
13 | 497410080a361 |
14 | 1d3600550d677 |
15 | cb4e0d4b3928 |
hex | 6458364215f9 |
110330030200313 has 32 divisors (see below), whose sum is σ = 145665467424000. Its totient is φ = 80903356047360.
The previous prime is 110330030200289. The next prime is 110330030200349. The reversal of 110330030200313 is 313002030033011.
It is not a de Polignac number, because 110330030200313 - 226 = 110329963091449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110330030200513) 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, 3977063 + ... + 15377811.
It is an arithmetic number, because the mean of its divisors is an integer number (4552045857000).
Almost surely, 2110330030200313 is an apocalyptic number.
It is an amenable number.
110330030200313 is a deficient number, since it is larger than the sum of its proper divisors (35335437223687).
110330030200313 is a wasteful number, since it uses less digits than its factorization.
110330030200313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11408177.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 110330030200313 its reverse (313002030033011), we get a palindrome (423332060233324).
The spelling of 110330030200313 in words is "one hundred ten trillion, three hundred thirty billion, thirty million, two hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •