Base | Representation |
---|---|
bin | 110100010100011001010101… |
… | …011000000111001110001111 |
3 | 1010011201100100100100110122221 |
4 | 310110121111120013032033 |
5 | 220124424310114102203 |
6 | 2133214252504320211 |
7 | 66316114521362413 |
oct | 6424312530071617 |
9 | 1104640310313587 |
10 | 230100010300303 |
11 | 67353959135250 |
12 | 21982b0ba73067 |
13 | 9b514513a6000 |
14 | 40b6c85552d43 |
15 | 1b90668e39abd |
hex | d1465560738f |
230100010300303 has 16 divisors (see below), whose sum is σ = 271926854589600. Its totient is φ = 193090917714240.
The previous prime is 230100010300297. The next prime is 230100010300319. The reversal of 230100010300303 is 303003010001032.
It is not a de Polignac number, because 230100010300303 - 213 = 230100010292111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230100010300343) 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 15 ways as a sum of consecutive naturals, for example, 4760600038 + ... + 4760648371.
It is an arithmetic number, because the mean of its divisors is an integer number (16995428411850).
Almost surely, 2230100010300303 is an apocalyptic number.
230100010300303 is a deficient number, since it is larger than the sum of its proper divisors (41826844289297).
230100010300303 is an equidigital number, since it uses as much as digits as its factorization.
230100010300303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9521248459 (or 9521248433 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 16.
Adding to 230100010300303 its reverse (303003010001032), we get a palindrome (533103020301335).
The spelling of 230100010300303 in words is "two hundred thirty trillion, one hundred billion, ten million, three hundred thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •