Base | Representation |
---|---|
bin | 1101101010000011100001… |
… | …01001010110100010000110 |
3 | 10221100001121201010212000111 |
4 | 12311001300221112202012 |
5 | 12414022123103101042 |
6 | 143512352042303234 |
7 | 6216522264266161 |
oct | 665016051264206 |
9 | 127301551125014 |
10 | 30032301222022 |
11 | 962969a110270 |
12 | 3450564ab7b1a |
13 | 139b0594b6788 |
14 | 75b7dd2a0ad8 |
15 | 371320966517 |
hex | 1b5070a56886 |
30032301222022 has 16 divisors (see below), whose sum is σ = 51730279617600. Its totient is φ = 12932569904040.
The previous prime is 30032301221983. The next prime is 30032301222073. The reversal of 30032301222022 is 22022210323003.
It is a super-2 number, since 2×300323012220222 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 30032301221984 and 30032301222002.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35923804872 + ... + 35923805707.
It is an arithmetic number, because the mean of its divisors is an integer number (3233142476100).
Almost surely, 230032301222022 is an apocalyptic number.
30032301222022 is a deficient number, since it is larger than the sum of its proper divisors (21697978395578).
30032301222022 is a wasteful number, since it uses less digits than its factorization.
30032301222022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71847610611.
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 30032301222022 its reverse (22022210323003), we get a palindrome (52054511545025).
The spelling of 30032301222022 in words is "thirty trillion, thirty-two billion, three hundred one million, two hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •