Base | Representation |
---|---|
bin | 1101101111010100010010… |
… | …10010100101010101111000 |
3 | 10221222100022010011120101201 |
4 | 12313222021102211111320 |
5 | 12430002413421411300 |
6 | 144131412534423544 |
7 | 6235552602550606 |
oct | 667521122452570 |
9 | 127870263146351 |
10 | 30213103310200 |
11 | 969933a18a138 |
12 | 347b603201bb4 |
13 | 13b21113624c5 |
14 | 76647180a876 |
15 | 375da37aa66a |
hex | 1b7a894a5578 |
30213103310200 has 48 divisors (see below), whose sum is σ = 73299615868080. Its totient is φ = 11559796047360.
The previous prime is 30213103310153. The next prime is 30213103310279. The reversal of 30213103310200 is 201330131203.
It is a super-2 number, since 2×302131033102002 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3284028369 + ... + 3284037568.
It is an arithmetic number, because the mean of its divisors is an integer number (1527075330585).
Almost surely, 230213103310200 is an apocalyptic number.
It is an amenable number.
30213103310200 is an abundant number, since it is smaller than the sum of its proper divisors (43086512557880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30213103310200 is a wasteful number, since it uses less digits than its factorization.
30213103310200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6568065976 (or 6568065967 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 30213103310200 its reverse (201330131203), we get a palindrome (30414433441403).
The spelling of 30213103310200 in words is "thirty trillion, two hundred thirteen billion, one hundred three million, three hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •