Base | Representation |
---|---|
bin | 11011101010110… |
… | …11101110100100 |
3 | 121011202110110011 |
4 | 31311123232210 |
5 | 433410023022 |
6 | 35010540004 |
7 | 5515624330 |
oct | 1565335644 |
9 | 534673404 |
10 | 232111012 |
11 | 10a025491 |
12 | 65897604 |
13 | 3911b0c3 |
14 | 22b807c0 |
15 | 1559d977 |
hex | dd5bba4 |
232111012 has 48 divisors (see below), whose sum is σ = 495774720. Its totient is φ = 92937600.
The previous prime is 232111001. The next prime is 232111057. The reversal of 232111012 is 210111232.
It is a junction number, because it is equal to n+sod(n) for n = 232110983 and 232111001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20562 + ... + 29782.
It is an arithmetic number, because the mean of its divisors is an integer number (10328640).
Almost surely, 2232111012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 232111012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (247887360).
232111012 is an abundant number, since it is smaller than the sum of its proper divisors (263663708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232111012 is a wasteful number, since it uses less digits than its factorization.
232111012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9292 (or 9290 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 232111012 is about 15235.1899233321. The cubic root of 232111012 is about 614.5613564160.
Adding to 232111012 its reverse (210111232), we get a palindrome (442222244).
The spelling of 232111012 in words is "two hundred thirty-two million, one hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •