Base | Representation |
---|---|
bin | 1101101110111110000111… |
… | …10011111001111100110010 |
3 | 10221221012120120102001001021 |
4 | 12313133003303321330302 |
5 | 12424304024224101002 |
6 | 144122123450130054 |
7 | 6234651616144555 |
oct | 667370363717462 |
9 | 127835516361037 |
10 | 30201200222002 |
11 | 96942911aa867 |
12 | 3479240a2092a |
13 | 13b0c652cc954 |
14 | 765a62a1869c |
15 | 3759087ce737 |
hex | 1b77c3cf9f32 |
30201200222002 has 8 divisors (see below), whose sum is σ = 45301974262812. Its totient is φ = 15100542134400.
The previous prime is 30201200221957. The next prime is 30201200222003. The reversal of 30201200222002 is 20022200210203.
It can be written as a sum of positive squares in 2 ways, for example, as 27385848456201 + 2815351765801 = 5233149^2 + 1677901^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×302012002220023 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (30201200222003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28334199 + ... + 29380762.
Almost surely, 230201200222002 is an apocalyptic number.
30201200222002 is a deficient number, since it is larger than the sum of its proper divisors (15100774040810).
30201200222002 is a wasteful number, since it uses less digits than its factorization.
30201200222002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57976604.
The product of its (nonzero) digits is 192, while the sum is 16.
Adding to 30201200222002 its reverse (20022200210203), we get a palindrome (50223400432205).
The spelling of 30201200222002 in words is "thirty trillion, two hundred one billion, two hundred million, two hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •