Base | Representation |
---|---|
bin | 1101101111110100001000… |
… | …11110000011011011000111 |
3 | 10222000222102202221020221001 |
4 | 12313322010132003123013 |
5 | 12430242423242100403 |
6 | 144143321353234131 |
7 | 6240026410556251 |
oct | 667720436033307 |
9 | 128028382836831 |
10 | 30230202300103 |
11 | 96a561410a353 |
12 | 3482995702947 |
13 | 13b3907a04700 |
14 | 7672146d6cd1 |
15 | 3765549d7c1d |
hex | 1b7e847836c7 |
30230202300103 has 12 divisors (see below), whose sum is σ = 32855270900448. Its totient is φ = 27801832331520.
The previous prime is 30230202300047. The next prime is 30230202300119. The reversal of 30230202300103 is 30100320203203.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-30230202300103 is a prime.
It is a super-2 number, since 2×302302023001032 (a number of 28 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 (30230202307103) 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, 329985450 + ... + 330077047.
It is an arithmetic number, because the mean of its divisors is an integer number (2737939241704).
Almost surely, 230230202300103 is an apocalyptic number.
30230202300103 is a deficient number, since it is larger than the sum of its proper divisors (2625068600345).
30230202300103 is a wasteful number, since it uses less digits than its factorization.
30230202300103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 660062794 (or 660062781 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 30230202300103 its reverse (30100320203203), we get a palindrome (60330522503306).
The spelling of 30230202300103 in words is "thirty trillion, two hundred thirty billion, two hundred two million, three hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.179 sec. • engine limits •