Base | Representation |
---|---|
bin | 1101101110111101110001… |
… | …00111000010101000001111 |
3 | 10221221012002110210121221100 |
4 | 12313132320213002220033 |
5 | 12424303133122102203 |
6 | 144122053054234143 |
7 | 6234644144634105 |
oct | 667367047025017 |
9 | 127835073717840 |
10 | 30201012300303 |
11 | 96941a5117479 |
12 | 34791a9ab5953 |
13 | 13b0c353b4190 |
14 | 765a45a9bc75 |
15 | 3758e705dea3 |
hex | 1b77b89c2a0f |
30201012300303 has 24 divisors (see below), whose sum is σ = 47006461468512. Its totient is φ = 18574513898688.
The previous prime is 30201012300301. The next prime is 30201012300323. The reversal of 30201012300303 is 30300321010203.
30201012300303 is a `hidden beast` number, since 30 + 2 + 0 + 101 + 230 + 0 + 303 = 666.
It is not a de Polignac number, because 30201012300303 - 21 = 30201012300301 is a prime.
It is a super-2 number, since 2×302010123003032 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30201012300301) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 74271651 + ... + 74677172.
It is an arithmetic number, because the mean of its divisors is an integer number (1958602561188).
Almost surely, 230201012300303 is an apocalyptic number.
30201012300303 is a deficient number, since it is larger than the sum of its proper divisors (16805449168209).
30201012300303 is a wasteful number, since it uses less digits than its factorization.
30201012300303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148950575 (or 148950572 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 30201012300303 its reverse (30300321010203), we get a palindrome (60501333310506).
The spelling of 30201012300303 in words is "thirty trillion, two hundred one billion, twelve million, three hundred thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •