Base | Representation |
---|---|
bin | 1101100000010100000… |
… | …0010110000010111001 |
3 | 211011212022220110120012 |
4 | 3120011000112002321 |
5 | 12300130111212421 |
6 | 254330202511305 |
7 | 22522323151241 |
oct | 3300500260271 |
9 | 734768813505 |
10 | 232012210361 |
11 | 8a4399316a8 |
12 | 38b70505535 |
13 | 18b56545299 |
14 | b32d882b21 |
15 | 607da7395b |
hex | 36050160b9 |
232012210361 has 12 divisors (see below), whose sum is σ = 245860767348. Its totient is φ = 218884621824.
The previous prime is 232012210321. The next prime is 232012210379. The reversal of 232012210361 is 163012210232.
It can be written as a sum of positive squares in 2 ways, for example, as 119867595961 + 112144614400 = 346219^2 + 334880^2 .
It is not a de Polignac number, because 232012210361 - 222 = 232008016057 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (232012210301) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2965400 + ... + 3042633.
It is an arithmetic number, because the mean of its divisors is an integer number (20488397279).
Almost surely, 2232012210361 is an apocalyptic number.
It is an amenable number.
232012210361 is a deficient number, since it is larger than the sum of its proper divisors (13848556987).
232012210361 is an equidigital number, since it uses as much as digits as its factorization.
232012210361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6008152 (or 6008129 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 232012210361 its reverse (163012210232), we get a palindrome (395024420593).
The spelling of 232012210361 in words is "two hundred thirty-two billion, twelve million, two hundred ten thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •