Base | Representation |
---|---|
bin | 101111001000101011… |
… | …1001110110011110100 |
3 | 100200021101222220121222 |
4 | 1132101113032303310 |
5 | 3124301044042400 |
6 | 114300132525512 |
7 | 10212254410406 |
oct | 1362127166364 |
9 | 320241886558 |
10 | 101223034100 |
11 | 39a23844791 |
12 | 1774b480898 |
13 | 971200a366 |
14 | 4c83668b76 |
15 | 29767c5185 |
hex | 17915cecf4 |
101223034100 has 18 divisors (see below), whose sum is σ = 219653984214. Its totient is φ = 40489213600.
The previous prime is 101223034097. The next prime is 101223034111. The reversal of 101223034100 is 1430322101.
It can be written as a sum of positive squares in 3 ways, for example, as 2932005904 + 98291028196 = 54148^2 + 313514^2 .
It is a super-2 number, since 2×1012230341002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 506115071 + ... + 506115270.
It is an arithmetic number, because the mean of its divisors is an integer number (12202999123).
Almost surely, 2101223034100 is an apocalyptic number.
101223034100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101223034100 is an abundant number, since it is smaller than the sum of its proper divisors (118430950114).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101223034100 is a wasteful number, since it uses less digits than its factorization.
101223034100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1012230355 (or 1012230348 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 101223034100 its reverse (1430322101), we get a palindrome (102653356201).
The spelling of 101223034100 in words is "one hundred one billion, two hundred twenty-three million, thirty-four thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •