Base | Representation |
---|---|
bin | 1001011001011101111010… |
… | …0011010000101000110110 |
3 | 1100120211121121100100212020 |
4 | 2112113132203100220312 |
5 | 2323244222303211042 |
6 | 33550550251534010 |
7 | 2114354411632065 |
oct | 226273643205066 |
9 | 40524547310766 |
10 | 10333130132022 |
11 | 332428a636915 |
12 | 11aa76845a306 |
13 | 59c543997339 |
14 | 27a1aa2b81dc |
15 | 12dbc5e273ec |
hex | 965de8d0a36 |
10333130132022 has 64 divisors (see below), whose sum is σ = 21291967119360. Its totient is φ = 3342031884576.
The previous prime is 10333130131993. The next prime is 10333130132027. The reversal of 10333130132022 is 22023103133301.
10333130132022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 10333130131983 and 10333130132001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10333130132027) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6368463 + ... + 7824549.
It is an arithmetic number, because the mean of its divisors is an integer number (332686986240).
Almost surely, 210333130132022 is an apocalyptic number.
10333130132022 is an abundant number, since it is smaller than the sum of its proper divisors (10958836987338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10333130132022 is a wasteful number, since it uses less digits than its factorization.
10333130132022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1456425.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 10333130132022 its reverse (22023103133301), we get a palindrome (32356233265323).
The spelling of 10333130132022 in words is "ten trillion, three hundred thirty-three billion, one hundred thirty million, one hundred thirty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •