Base | Representation |
---|---|
bin | 10111000010000111111011… |
… | …011000111110000100111100 |
3 | 111021200021122100102112222121 |
4 | 113002013323120332010330 |
5 | 101234203442423144400 |
6 | 555241014032252324 |
7 | 30223520512561663 |
oct | 2702077330760474 |
9 | 437607570375877 |
10 | 101301021303100 |
11 | 2a306581682513 |
12 | b4409970a10a4 |
13 | 446a8509c8b38 |
14 | 1b02dd1c91dda |
15 | baa1131d321a |
hex | 5c21fb63e13c |
101301021303100 has 36 divisors (see below), whose sum is σ = 222605788602400. Its totient is φ = 40007491954560.
The previous prime is 101301021303091. The next prime is 101301021303103. The reversal of 101301021303100 is 1303120103101.
It is a super-2 number, since 2×1013010213031002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101301021303103) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6411449145 + ... + 6411464944.
Almost surely, 2101301021303100 is an apocalyptic number.
101301021303100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101301021303100 is an abundant number, since it is smaller than the sum of its proper divisors (121304767299300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101301021303100 is a wasteful number, since it uses less digits than its factorization.
101301021303100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12822914182 (or 12822914175 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 101301021303100 its reverse (1303120103101), we get a palindrome (102604141406201).
The spelling of 101301021303100 in words is "one hundred one trillion, three hundred one billion, twenty-one million, three hundred three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •