Base | Representation |
---|---|
bin | 110100010100011011010011… |
… | …001001001000000111001011 |
3 | 1010011201112210101200121111000 |
4 | 310110123103021020013023 |
5 | 220124443120244113003 |
6 | 2133215242121110043 |
7 | 66316221022161066 |
oct | 6424332311100713 |
9 | 1104645711617430 |
10 | 230102120301003 |
11 | 67354841183a85 |
12 | 219833ba628323 |
13 | 9b516c9585b32 |
14 | 40b70058838dd |
15 | 1b9073e2ca1a3 |
hex | d146d32481cb |
230102120301003 has 8 divisors (see below), whose sum is σ = 340892030075600. Its totient is φ = 153401413533984.
The previous prime is 230102120300971. The next prime is 230102120301017. The reversal of 230102120301003 is 300103021201032.
230102120301003 is a `hidden beast` number, since 230 + 10 + 2 + 120 + 301 + 0 + 0 + 3 = 666.
It is not a de Polignac number, because 230102120301003 - 25 = 230102120300971 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (230102120301023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4261150375918 + ... + 4261150375971.
It is an arithmetic number, because the mean of its divisors is an integer number (42611503759450).
Almost surely, 2230102120301003 is an apocalyptic number.
230102120301003 is a deficient number, since it is larger than the sum of its proper divisors (110789909774597).
230102120301003 is an equidigital number, since it uses as much as digits as its factorization.
230102120301003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8522300751898 (or 8522300751892 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 230102120301003 its reverse (300103021201032), we get a palindrome (530205141502035).
The spelling of 230102120301003 in words is "two hundred thirty trillion, one hundred two billion, one hundred twenty million, three hundred one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •