Base | Representation |
---|---|
bin | 101101111111110110110101… |
… | …100001101111011100110111 |
3 | 222112021201102202011010101100 |
4 | 231333312311201233130313 |
5 | 203003442003313130403 |
6 | 1554131250324301143 |
7 | 60416500011646140 |
oct | 5577666541573467 |
9 | 875251382133340 |
10 | 202300300130103 |
11 | 5950609151363a |
12 | 1a8331a12417b3 |
13 | 88b5ab4896c16 |
14 | 37d555b420ac7 |
15 | 185c465c632a3 |
hex | b7fdb586f737 |
202300300130103 has 12 divisors (see below), whose sum is σ = 333956051008528. Its totient is φ = 115600171502880.
The previous prime is 202300300130101. The next prime is 202300300130113. The reversal of 202300300130103 is 301031003003202.
202300300130103 is a `hidden beast` number, since 2 + 0 + 230 + 0 + 300 + 1 + 30 + 103 = 666.
It is not a de Polignac number, because 202300300130103 - 21 = 202300300130101 is a prime.
It is a super-2 number, since 2×2023003001301032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202300300130101) 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, 1605557937478 + ... + 1605557937603.
Almost surely, 2202300300130103 is an apocalyptic number.
202300300130103 is a deficient number, since it is larger than the sum of its proper divisors (131655750878425).
202300300130103 is a wasteful number, since it uses less digits than its factorization.
202300300130103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3211115875094 (or 3211115875091 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 202300300130103 its reverse (301031003003202), we get a palindrome (503331303133305).
The spelling of 202300300130103 in words is "two hundred two trillion, three hundred billion, three hundred million, one hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •