Base | Representation |
---|---|
bin | 10011001111100100… |
… | …11110100010100101 |
3 | 222200000000100201201 |
4 | 21213302132202211 |
5 | 132124243021013 |
6 | 4425053522501 |
7 | 514005631213 |
oct | 114762364245 |
9 | 28600010651 |
10 | 10331220133 |
11 | 4421782663 |
12 | 2003aa3431 |
13 | c884c9710 |
14 | 700141cb3 |
15 | 406ed73dd |
hex | 267c9e8a5 |
10331220133 has 8 divisors (see below), whose sum is σ = 11128594176. Its totient is φ = 9534226800.
The previous prime is 10331220131. The next prime is 10331220157. The reversal of 10331220133 is 33102213301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10331220133 - 21 = 10331220131 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10331220133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10331220131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37513 + ... + 148558.
It is an arithmetic number, because the mean of its divisors is an integer number (1391074272).
Almost surely, 210331220133 is an apocalyptic number.
10331220133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10331220133 is a deficient number, since it is larger than the sum of its proper divisors (797374043).
10331220133 is a wasteful number, since it uses less digits than its factorization.
10331220133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 190355.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 10331220133 its reverse (33102213301), we get a palindrome (43433433434).
The spelling of 10331220133 in words is "ten billion, three hundred thirty-one million, two hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •