Base | Representation |
---|---|
bin | 1101101111010100100000… |
… | …11000111001010110011100 |
3 | 10221222100121102021020110221 |
4 | 12313222100120321112130 |
5 | 12430003134413434112 |
6 | 144131432431211124 |
7 | 6235555550053405 |
oct | 667522030712634 |
9 | 127870542236427 |
10 | 30213222405532 |
11 | 96993a0433231 |
12 | 347b637076aa4 |
13 | 13b212cc3070a |
14 | 76648356c9ac |
15 | 375dade82e07 |
hex | 1b7a9063959c |
30213222405532 has 24 divisors (see below), whose sum is σ = 56932193772720. Its totient is φ = 13977004181760.
The previous prime is 30213222405479. The next prime is 30213222405547. The reversal of 30213222405532 is 23550422231203.
It is a super-2 number, since 2×302132224055322 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (34).
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 7 ways as a sum of consecutive naturals, for example, 3765352719 + ... + 3765360742.
It is an arithmetic number, because the mean of its divisors is an integer number (2372174740530).
Almost surely, 230213222405532 is an apocalyptic number.
It is an amenable number.
30213222405532 is a deficient number, since it is larger than the sum of its proper divisors (26718971367188).
30213222405532 is a wasteful number, since it uses less digits than its factorization.
30213222405532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7530713541 (or 7530713539 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 34.
Adding to 30213222405532 its reverse (23550422231203), we get a palindrome (53763644636735).
The spelling of 30213222405532 in words is "thirty trillion, two hundred thirteen billion, two hundred twenty-two million, four hundred five thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •