Base | Representation |
---|---|
bin | 1101011101001001100… |
… | …1010100111011111011 |
3 | 211002200011012021111000 |
4 | 3113102121110323323 |
5 | 12241410224341103 |
6 | 254110031540043 |
7 | 22462303053234 |
oct | 3272231247373 |
9 | 732604167430 |
10 | 231163121403 |
11 | 8a043612595 |
12 | 3897408a623 |
13 | 18a4c665896 |
14 | b28cbba08b |
15 | 602e251aa3 |
hex | 35d2654efb |
231163121403 has 16 divisors (see below), whose sum is σ = 342661566240. Its totient is φ = 154019790432.
The previous prime is 231163121389. The next prime is 231163121461. The reversal of 231163121403 is 304121361132.
It is a happy number.
231163121403 is a `hidden beast` number, since 2 + 3 + 1 + 1 + 631 + 21 + 4 + 0 + 3 = 666.
It is not a de Polignac number, because 231163121403 - 29 = 231163120891 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (231163121473) 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 15 ways as a sum of consecutive naturals, for example, 2423376 + ... + 2516957.
It is an arithmetic number, because the mean of its divisors is an integer number (21416347890).
Almost surely, 2231163121403 is an apocalyptic number.
231163121403 is a deficient number, since it is larger than the sum of its proper divisors (111498444837).
231163121403 is a wasteful number, since it uses less digits than its factorization.
231163121403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4942075 (or 4942069 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 231163121403 its reverse (304121361132), we get a palindrome (535284482535).
The spelling of 231163121403 in words is "two hundred thirty-one billion, one hundred sixty-three million, one hundred twenty-one thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •