Base | Representation |
---|---|
bin | 10010110111111110… |
… | …01010111101111001 |
3 | 222011012102222022102 |
4 | 21123333022331321 |
5 | 131223101034431 |
6 | 4353302033145 |
7 | 506052650033 |
oct | 113377127571 |
9 | 28135388272 |
10 | 10133221241 |
11 | 432aa37110 |
12 | 1b697187b5 |
13 | c56493200 |
14 | 6c1b20c53 |
15 | 3e4925dcb |
hex | 25bfcaf79 |
10133221241 has 48 divisors (see below), whose sum is σ = 12255858432. Its totient is φ = 8302694400.
The previous prime is 10133221211. The next prime is 10133221247. The reversal of 10133221241 is 14212233101.
It is not a de Polignac number, because 10133221241 - 210 = 10133220217 is a prime.
It is a super-3 number, since 3×101332212413 (a number of 31 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (10133221247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 21885776 + ... + 21886238.
It is an arithmetic number, because the mean of its divisors is an integer number (255330384).
Almost surely, 210133221241 is an apocalyptic number.
10133221241 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10133221241 is a deficient number, since it is larger than the sum of its proper divisors (2122637191).
10133221241 is a wasteful number, since it uses less digits than its factorization.
10133221241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 754 (or 741 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 10133221241 its reverse (14212233101), we get a palindrome (24345454342).
The spelling of 10133221241 in words is "ten billion, one hundred thirty-three million, two hundred twenty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •