Base | Representation |
---|---|
bin | 11000000110110011110001… |
… | …100011100000010101011000 |
3 | 111220101111210112202120120122 |
4 | 120012303301203200111120 |
5 | 102344022024442213000 |
6 | 1013253215304012412 |
7 | 31221523562165024 |
oct | 3006636143402530 |
9 | 456344715676518 |
10 | 106021025351000 |
11 | 3086629a936a71 |
12 | ba83702a61108 |
13 | 4720980425726 |
14 | 1c27633153384 |
15 | c3ccb4511085 |
hex | 606cf18e0558 |
106021025351000 has 96 divisors (see below), whose sum is σ = 263541122488800. Its totient is φ = 39913797670400.
The previous prime is 106021025350991. The next prime is 106021025351029. The reversal of 106021025351000 is 153520120601.
It is a super-2 number, since 2×1060210253510002 (a number of 29 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 23 ways as a sum of consecutive naturals, for example, 183138380 + ... + 183716379.
It is an arithmetic number, because the mean of its divisors is an integer number (2745220025925).
Almost surely, 2106021025351000 is an apocalyptic number.
106021025351000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106021025351000 is an abundant number, since it is smaller than the sum of its proper divisors (157520097137800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106021025351000 is a wasteful number, since it uses less digits than its factorization.
106021025351000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 366854814 (or 366854783 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 106021025351000 its reverse (153520120601), we get a palindrome (106174545471601).
The spelling of 106021025351000 in words is "one hundred six trillion, twenty-one billion, twenty-five million, three hundred fifty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.901 sec. • engine limits •