Base | Representation |
---|---|
bin | 1001010010111000011110… |
… | …1110111111111110110000 |
3 | 1100012000121200101212220020 |
4 | 2110232013232333332300 |
5 | 2314421032114121112 |
6 | 33423001043443440 |
7 | 2103241144265610 |
oct | 224560756777660 |
9 | 40160550355806 |
10 | 10220004442032 |
11 | 3290309088640 |
12 | 1190856986580 |
13 | 591985a49138 |
14 | 274917d30a40 |
15 | 12aca470e48c |
hex | 94b87bbffb0 |
10220004442032 has 80 divisors (see below), whose sum is σ = 32916377955072. Its totient is φ = 2654546607360.
The previous prime is 10220004442031. The next prime is 10220004442051. The reversal of 10220004442032 is 23024440002201.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 10220004441993 and 10220004442011.
It is not an unprimeable number, because it can be changed into a prime (10220004442031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1382572663 + ... + 1382580054.
Almost surely, 210220004442032 is an apocalyptic number.
10220004442032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10220004442032 is an abundant number, since it is smaller than the sum of its proper divisors (22696373513040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10220004442032 is a wasteful number, since it uses less digits than its factorization.
10220004442032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2765152746 (or 2765152740 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 24.
Adding to 10220004442032 its reverse (23024440002201), we get a palindrome (33244444444233).
The spelling of 10220004442032 in words is "ten trillion, two hundred twenty billion, four million, four hundred forty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •