Base | Representation |
---|---|
bin | 1001010011011110011110… |
… | …0100110010011000011101 |
3 | 1100012222221101111100220010 |
4 | 2110313213210302120131 |
5 | 2320102423242442341 |
6 | 33431405015313433 |
7 | 2104051643614563 |
oct | 224674744623035 |
9 | 40188841440803 |
10 | 10230202312221 |
11 | 3294671560431 |
12 | 119282207b879 |
13 | 59291c726358 |
14 | 27520447da33 |
15 | 12b19eb55716 |
hex | 94de793261d |
10230202312221 has 32 divisors (see below), whose sum is σ = 13729174018560. Its totient is φ = 6775783833600.
The previous prime is 10230202312193. The next prime is 10230202312271. The reversal of 10230202312221 is 12221320203201.
It is not a de Polignac number, because 10230202312221 - 25 = 10230202312189 is a prime.
It is a super-3 number, since 3×102302023122213 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10230202312271) 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 31 ways as a sum of consecutive naturals, for example, 1791312556 + ... + 1791318266.
It is an arithmetic number, because the mean of its divisors is an integer number (429036688080).
Almost surely, 210230202312221 is an apocalyptic number.
It is an amenable number.
10230202312221 is a deficient number, since it is larger than the sum of its proper divisors (3498971706339).
10230202312221 is a wasteful number, since it uses less digits than its factorization.
10230202312221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9477.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 10230202312221 its reverse (12221320203201), we get a palindrome (22451522515422).
The spelling of 10230202312221 in words is "ten trillion, two hundred thirty billion, two hundred two million, three hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •