Base | Representation |
---|---|
bin | 110100010111110001100101… |
… | …101111001100100111000010 |
3 | 1010012112112200221201212110000 |
4 | 310113301211233030213002 |
5 | 220142230333013133442 |
6 | 2133513054034420430 |
7 | 66341644650056022 |
oct | 6427614557144702 |
9 | 1105475627655400 |
10 | 230332213021122 |
11 | 67433385558203 |
12 | 219bbb14131716 |
13 | 9b6a308232174 |
14 | 40c41d2427a82 |
15 | 1b96709590d4c |
hex | d17c65bcc9c2 |
230332213021122 has 40 divisors (see below), whose sum is σ = 516115645577532. Its totient is φ = 76777274628000.
The previous prime is 230332213021111. The next prime is 230332213021153. The reversal of 230332213021122 is 221120312233032.
230332213021122 is a `hidden beast` number, since 2 + 3 + 0 + 3 + 322 + 1 + 302 + 11 + 22 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 209946798390681 + 20385414630441 = 14489541^2 + 4515021^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 170590872 + ... + 171935772.
Almost surely, 2230332213021122 is an apocalyptic number.
230332213021122 is an abundant number, since it is smaller than the sum of its proper divisors (285783432556410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230332213021122 is a wasteful number, since it uses less digits than its factorization.
230332213021122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2402096 (or 2402087 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 230332213021122 its reverse (221120312233032), we get a palindrome (451452525254154).
The spelling of 230332213021122 in words is "two hundred thirty trillion, three hundred thirty-two billion, two hundred thirteen million, twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •