Base | Representation |
---|---|
bin | 1101101111010100011111… |
… | …01001110001111001001110 |
3 | 10221222100120120000201200000 |
4 | 12313222033221301321032 |
5 | 12430003123233213342 |
6 | 144131431310345130 |
7 | 6235555340061636 |
oct | 667521751617116 |
9 | 127870516021600 |
10 | 30213210054222 |
11 | 9699394467538 |
12 | 347b632abb1a6 |
13 | 13b212a4c7850 |
14 | 766481a756c6 |
15 | 375dacd4344c |
hex | 1b7a8fa71e4e |
30213210054222 has 48 divisors (see below), whose sum is σ = 73108508294640. Its totient is φ = 9296372322432.
The previous prime is 30213210054221. The next prime is 30213210054241. The reversal of 30213210054222 is 22245001231203.
30213210054222 is a `hidden beast` number, since 3 + 0 + 2 + 13 + 2 + 100 + 542 + 2 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30213210054221) 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, 2391035947 + ... + 2391048582.
It is an arithmetic number, because the mean of its divisors is an integer number (1523093922805).
Almost surely, 230213210054222 is an apocalyptic number.
30213210054222 is an abundant number, since it is smaller than the sum of its proper divisors (42895298240418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30213210054222 is a wasteful number, since it uses less digits than its factorization.
30213210054222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4782084559 (or 4782084547 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
Adding to 30213210054222 its reverse (22245001231203), we get a palindrome (52458211285425).
The spelling of 30213210054222 in words is "thirty trillion, two hundred thirteen billion, two hundred ten million, fifty-four thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •