Base | Representation |
---|---|
bin | 110100010101111001100011… |
… | …110010100100100011001111 |
3 | 1010012002020000222002201100211 |
4 | 310111321203302210203033 |
5 | 220133122410310113203 |
6 | 2133333541144503251 |
7 | 66326433102561100 |
oct | 6425714362444317 |
9 | 1105066028081324 |
10 | 230203331332303 |
11 | 6739375916a89a |
12 | 2199ab45a7ab27 |
13 | 9b5b108c4cb34 |
14 | 40bbc876a63a7 |
15 | 1b931b49cdc6d |
hex | d15e63ca48cf |
230203331332303 has 12 divisors (see below), whose sum is σ = 267787946775720. Its totient is φ = 197316847817712.
The previous prime is 230203331332283. The next prime is 230203331332313. The reversal of 230203331332303 is 303233133302032.
It is not a de Polignac number, because 230203331332303 - 29 = 230203331331791 is a prime.
It is a super-2 number, since 2×2302033313323032 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230203331332313) 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, 33837133 + ... + 40066921.
It is an arithmetic number, because the mean of its divisors is an integer number (22315662231310).
Almost surely, 2230203331332303 is an apocalyptic number.
230203331332303 is a deficient number, since it is larger than the sum of its proper divisors (37584615443417).
230203331332303 is an equidigital number, since it uses as much as digits as its factorization.
230203331332303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6983926 (or 6983919 counting only the distinct ones).
The product of its (nonzero) digits is 52488, while the sum is 31.
Adding to 230203331332303 its reverse (303233133302032), we get a palindrome (533436464634335).
The spelling of 230203331332303 in words is "two hundred thirty trillion, two hundred three billion, three hundred thirty-one million, three hundred thirty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •