Base | Representation |
---|---|
bin | 1001010001110010100000… |
… | …1011000111100001010110 |
3 | 1100010020010122122222112101 |
4 | 2110130220023013201112 |
5 | 2314114100130043110 |
6 | 33410213144312314 |
7 | 2102004526421212 |
oct | 224345013074126 |
9 | 40106118588471 |
10 | 10201221331030 |
11 | 328334a550304 |
12 | 118909447269a |
13 | 58cc814ca082 |
14 | 273a554d3942 |
15 | 12a55571813a |
hex | 947282c7856 |
10201221331030 has 16 divisors (see below), whose sum is σ = 18362364315264. Its totient is φ = 4080451661440.
The previous prime is 10201221331027. The next prime is 10201221331087. The reversal of 10201221331030 is 3013312210201.
It is a super-2 number, since 2×102012213310302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10201221330989 and 10201221331007.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3432547 + ... + 5673166.
It is an arithmetic number, because the mean of its divisors is an integer number (1147647769704).
Almost surely, 210201221331030 is an apocalyptic number.
10201221331030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10201221331030 is a deficient number, since it is larger than the sum of its proper divisors (8161142984234).
10201221331030 is a wasteful number, since it uses less digits than its factorization.
10201221331030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9217751.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 10201221331030 its reverse (3013312210201), we get a palindrome (13214533541231).
The spelling of 10201221331030 in words is "ten trillion, two hundred one billion, two hundred twenty-one million, three hundred thirty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •