Base | Representation |
---|---|
bin | 1001010010111111111110… |
… | …0111001001100101100110 |
3 | 1100012012210211211211202210 |
4 | 2110233333213021211212 |
5 | 2314434142001301100 |
6 | 33423532410544250 |
7 | 2103342035261253 |
oct | 224577747114546 |
9 | 40165724754683 |
10 | 10222015650150 |
11 | 3291150390007 |
12 | 1191118438086 |
13 | 591c16618c05 |
14 | 274a690a642a |
15 | 12ad71087c50 |
hex | 94bff9c9966 |
10222015650150 has 48 divisors (see below), whose sum is σ = 26452798769664. Its totient is φ = 2607354715680.
The previous prime is 10222015650113. The next prime is 10222015650157. The reversal of 10222015650150 is 5105651022201.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222015650157) 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, 1481448094 + ... + 1481454993.
It is an arithmetic number, because the mean of its divisors is an integer number (551099974368).
Almost surely, 210222015650150 is an apocalyptic number.
10222015650150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10222015650150 is an abundant number, since it is smaller than the sum of its proper divisors (16230783119514).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10222015650150 is a wasteful number, since it uses less digits than its factorization.
10222015650150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2962903125 (or 2962903120 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 30.
Adding to 10222015650150 its reverse (5105651022201), we get a palindrome (15327666672351).
The spelling of 10222015650150 in words is "ten trillion, two hundred twenty-two billion, fifteen million, six hundred fifty thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •