Base | Representation |
---|---|
bin | 1001010011000001001010… |
… | …0011000000101101101010 |
3 | 1100012020121222121202210110 |
4 | 2110300102203000231222 |
5 | 2314440314313113310 |
6 | 33424024115555150 |
7 | 2103352643444340 |
oct | 224602243005552 |
9 | 40166558552713 |
10 | 10222333332330 |
11 | 32912a3741369 |
12 | 11911a68bbab6 |
13 | 591c67398132 |
14 | 274a9935d990 |
15 | 12ad8dddad20 |
hex | 94c128c0b6a |
10222333332330 has 32 divisors (see below), whose sum is σ = 28038399997824. Its totient is φ = 2336533333056.
The previous prime is 10222333332317. The next prime is 10222333332359. The reversal of 10222333332330 is 3323333322201.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24338888677 + ... + 24338889096.
It is an arithmetic number, because the mean of its divisors is an integer number (876199999932).
Almost surely, 210222333332330 is an apocalyptic number.
10222333332330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10222333332330 is an abundant number, since it is smaller than the sum of its proper divisors (17816066665494).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10222333332330 is a wasteful number, since it uses less digits than its factorization.
10222333332330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48677777790.
The product of its (nonzero) digits is 34992, while the sum is 30.
Adding to 10222333332330 its reverse (3323333322201), we get a palindrome (13545666654531).
The spelling of 10222333332330 in words is "ten trillion, two hundred twenty-two billion, three hundred thirty-three million, three hundred thirty-two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •