Base | Representation |
---|---|
bin | 110100010100100011110111… |
… | …000100111100101100000011 |
3 | 1010011202102112001121012102210 |
4 | 310110203313010330230003 |
5 | 220130120432124320003 |
6 | 2133223402231113203 |
7 | 66316664565640500 |
oct | 6424436704745403 |
9 | 1104672461535383 |
10 | 230111313120003 |
11 | 673587292a2a57 |
12 | 21985145212803 |
13 | 9b52532c779c3 |
14 | 40b763872c4a7 |
15 | 1b90acb393503 |
hex | d148f713cb03 |
230111313120003 has 192 divisors, whose sum is σ = 382319971038720. Its totient is φ = 122509275033600.
The previous prime is 230111313119923. The next prime is 230111313120041. The reversal of 230111313120003 is 300021313111032.
It is a happy number.
It is not a de Polignac number, because 230111313120003 - 210 = 230111313118979 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (230111313122003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 58537599948 + ... + 58537603878.
It is an arithmetic number, because the mean of its divisors is an integer number (1991249849160).
Almost surely, 2230111313120003 is an apocalyptic number.
230111313120003 is a deficient number, since it is larger than the sum of its proper divisors (152208657918717).
230111313120003 is a wasteful number, since it uses less digits than its factorization.
230111313120003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6978 (or 6971 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 230111313120003 its reverse (300021313111032), we get a palindrome (530132626231035).
The spelling of 230111313120003 in words is "two hundred thirty trillion, one hundred eleven billion, three hundred thirteen million, one hundred twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •