Base | Representation |
---|---|
bin | 1100000100010… |
… | …10101010000001 |
3 | 21001111002010221 |
4 | 12002022222001 |
5 | 201403344413 |
6 | 14013423041 |
7 | 2336310535 |
oct | 602125201 |
9 | 231432127 |
10 | 101231233 |
11 | 52162584 |
12 | 29a9aa81 |
13 | 17c8504c |
14 | d631bc5 |
15 | 8d4968d |
hex | 608aa81 |
101231233 has 4 divisors (see below), whose sum is σ = 101347540. Its totient is φ = 101114928.
The previous prime is 101231227. The next prime is 101231239. The reversal of 101231233 is 332132101.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (101231227) and next prime (101231239).
It can be written as a sum of positive squares in 2 ways, for example, as 53993104 + 47238129 = 7348^2 + 6873^2 .
It is a cyclic number.
It is not a de Polignac number, because 101231233 - 29 = 101230721 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101231239) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 56838 + ... + 58591.
It is an arithmetic number, because the mean of its divisors is an integer number (25336885).
Almost surely, 2101231233 is an apocalyptic number.
It is an amenable number.
101231233 is a deficient number, since it is larger than the sum of its proper divisors (116307).
101231233 is an equidigital number, since it uses as much as digits as its factorization.
101231233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116306.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 101231233 is about 10061.3733158054. The cubic root of 101231233 is about 466.0560773569.
Adding to 101231233 its reverse (332132101), we get a palindrome (433363334).
The spelling of 101231233 in words is "one hundred one million, two hundred thirty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •