Base | Representation |
---|---|
bin | 1101011100111101111… |
… | …0000100001110100000 |
3 | 211002112201211021112011 |
4 | 3113033132010032200 |
5 | 12241310143011112 |
6 | 254101115442304 |
7 | 22461135600442 |
oct | 3271736041640 |
9 | 732481737464 |
10 | 231114032032 |
11 | 8a018933a64 |
12 | 3895b756394 |
13 | 18a42438b10 |
14 | b28647c492 |
15 | 6029ca6aa7 |
hex | 35cf7843a0 |
231114032032 has 24 divisors (see below), whose sum is σ = 490006193796. Its totient is φ = 106668014592.
The previous prime is 231114031927. The next prime is 231114032059. The reversal of 231114032032 is 230230411132.
231114032032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 182469082896 + 48644949136 = 427164^2 + 220556^2 .
It is a junction number, because it is equal to n+sod(n) for n = 231114031994 and 231114032012.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 277780873 + ... + 277781704.
Almost surely, 2231114032032 is an apocalyptic number.
It is an amenable number.
231114032032 is an abundant number, since it is smaller than the sum of its proper divisors (258892161764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231114032032 is a wasteful number, since it uses less digits than its factorization.
231114032032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 555562600 (or 555562592 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 231114032032 its reverse (230230411132), we get a palindrome (461344443164).
The spelling of 231114032032 in words is "two hundred thirty-one billion, one hundred fourteen million, thirty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •