Base | Representation |
---|---|
bin | 101111001000101011… |
… | …1111001110011110110 |
3 | 100200021102022212020022 |
4 | 1132101113321303312 |
5 | 3124301120211410 |
6 | 114300140405142 |
7 | 10212256043042 |
oct | 1362127716366 |
9 | 320242285208 |
10 | 101223210230 |
11 | 39a2395504a |
12 | 1774b5467b2 |
13 | 971206c58c |
14 | 4c836b3022 |
15 | 297680c455 |
hex | 17915f9cf6 |
101223210230 has 8 divisors (see below), whose sum is σ = 182201778432. Its totient is φ = 40489284088.
The previous prime is 101223210203. The next prime is 101223210259. The reversal of 101223210230 is 32012322101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1012232102302 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 101223210199 and 101223210208.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 5061160502 + ... + 5061160521.
It is an arithmetic number, because the mean of its divisors is an integer number (22775222304).
Almost surely, 2101223210230 is an apocalyptic number.
101223210230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101223210230 is a deficient number, since it is larger than the sum of its proper divisors (80978568202).
101223210230 is a wasteful number, since it uses less digits than its factorization.
101223210230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10122321030.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 101223210230 its reverse (32012322101), we get a palindrome (133235532331).
The spelling of 101223210230 in words is "one hundred one billion, two hundred twenty-three million, two hundred ten thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •