Base | Representation |
---|---|
bin | 1100000101000… |
… | …01010111001001 |
3 | 21001122210201101 |
4 | 12002201113021 |
5 | 201414333413 |
6 | 14015421401 |
7 | 2340145633 |
oct | 602412711 |
9 | 231583641 |
10 | 101324233 |
11 | 5221643a |
12 | 29b24861 |
13 | 17cb848a |
14 | d657a53 |
15 | 8d66edd |
hex | 60a15c9 |
101324233 has 16 divisors (see below), whose sum is σ = 109814400. Its totient is φ = 93139200.
The previous prime is 101324227. The next prime is 101324281. The reversal of 101324233 is 332423101.
It is a cyclic number.
It is not a de Polignac number, because 101324233 - 29 = 101323721 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 101324233.
It is not an unprimeable number, because it can be changed into a prime (101324533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 206118 + ... + 206608.
It is an arithmetic number, because the mean of its divisors is an integer number (6863400).
Almost surely, 2101324233 is an apocalyptic number.
It is an amenable number.
101324233 is a deficient number, since it is larger than the sum of its proper divisors (8490167).
101324233 is a wasteful number, since it uses less digits than its factorization.
101324233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 768.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 101324233 is about 10065.9938903220. The cubic root of 101324233 is about 466.1987538403.
Adding to 101324233 its reverse (332423101), we get a palindrome (433747334).
It can be divided in two parts, 10132 and 4233, that added together give a triangular number (14365 = T169).
The spelling of 101324233 in words is "one hundred one million, three hundred twenty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •