Base | Representation |
---|---|
bin | 10110111110000101111110… |
… | …000110100010101010110100 |
3 | 111020200210201010220021211120 |
4 | 112332011332012202222310 |
5 | 101220134214100211200 |
6 | 554505445352103540 |
7 | 30164513631424245 |
oct | 2676057606425264 |
9 | 436623633807746 |
10 | 101024041413300 |
11 | 2a20a067760785 |
12 | b3b7177094bb0 |
13 | 444a6ac17aa15 |
14 | 1ad3838194ccc |
15 | ba2d019a79a0 |
hex | 5be17e1a2ab4 |
101024041413300 has 36 divisors (see below), whose sum is σ = 292296226490016. Its totient is φ = 26939744376800.
The previous prime is 101024041413187. The next prime is 101024041413301. The reversal of 101024041413300 is 3314140420101.
It is a super-2 number, since 2×1010240414133002 (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 (101024041413301) 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, 168373402056 + ... + 168373402655.
Almost surely, 2101024041413300 is an apocalyptic number.
101024041413300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101024041413300 is an abundant number, since it is smaller than the sum of its proper divisors (191272185076716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101024041413300 is a wasteful number, since it uses less digits than its factorization.
101024041413300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336746804728 (or 336746804721 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 101024041413300 its reverse (3314140420101), we get a palindrome (104338181833401).
The spelling of 101024041413300 in words is "one hundred one trillion, twenty-four billion, forty-one million, four hundred thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •