Base | Representation |
---|---|
bin | 1101011100111010110… |
… | …0011001100101100011 |
3 | 211002111211022210211201 |
4 | 3113032230121211203 |
5 | 12241243324343243 |
6 | 254055532422031 |
7 | 22460620123216 |
oct | 3271654314543 |
9 | 732454283751 |
10 | 231101012323 |
11 | 8a011551075 |
12 | 38957317917 |
13 | 18a3c82a94c |
14 | b28484d77d |
15 | 6028a8404d |
hex | 35ceb19963 |
231101012323 has 8 divisors (see below), whose sum is σ = 241154795808. Its totient is φ = 221047721664.
The previous prime is 231101012279. The next prime is 231101012371. The reversal of 231101012323 is 323210101132.
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 231101012323 - 225 = 231067457891 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 231101012323.
It is not an unprimeable number, because it can be changed into a prime (231101012393) 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, 1088865 + ... + 1283677.
It is an arithmetic number, because the mean of its divisors is an integer number (30144349476).
Almost surely, 2231101012323 is an apocalyptic number.
231101012323 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
231101012323 is a deficient number, since it is larger than the sum of its proper divisors (10053783485).
231101012323 is a wasteful number, since it uses less digits than its factorization.
231101012323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246413.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 231101012323 its reverse (323210101132), we get a palindrome (554311113455).
The spelling of 231101012323 in words is "two hundred thirty-one billion, one hundred one million, twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •