Base | Representation |
---|---|
bin | 101110001101011000101100… |
… | …100111110000000010010010 |
3 | 222122120121011220102101101100 |
4 | 232031120230213300002102 |
5 | 203114210030322130002 |
6 | 2000122324521445230 |
7 | 60543612063031503 |
oct | 5615305447600222 |
9 | 878517156371340 |
10 | 203230011130002 |
11 | 598344000a63aa |
12 | 1a963407640816 |
13 | 895267a89c02c |
14 | 3828556702baa |
15 | 187672b82e11c |
hex | b8d62c9f0092 |
203230011130002 has 24 divisors (see below), whose sum is σ = 440344291409100. Its totient is φ = 67741398485280.
The previous prime is 203230011129967. The next prime is 203230011130009. The reversal of 203230011130002 is 200031110032302.
203230011130002 is a `hidden beast` number, since 20 + 3 + 230 + 0 + 111 + 300 + 0 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 188971238515761 + 14258772614241 = 13746681^2 + 3776079^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (203230011130009) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 160899949 + ... + 162158112.
Almost surely, 2203230011130002 is an apocalyptic number.
203230011130002 is an abundant number, since it is smaller than the sum of its proper divisors (237114280279098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203230011130002 is a wasteful number, since it uses less digits than its factorization.
203230011130002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 323093018 (or 323093015 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 203230011130002 its reverse (200031110032302), we get a palindrome (403261121162304).
The spelling of 203230011130002 in words is "two hundred three trillion, two hundred thirty billion, eleven million, one hundred thirty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •