Base | Representation |
---|---|
bin | 10111000001010000010011… |
… | …110010001011110111110000 |
3 | 111021110120111100012001111121 |
4 | 113001100103302023313300 |
5 | 101232214141030233430 |
6 | 555153340035352024 |
7 | 30216304550563546 |
oct | 2701202362136760 |
9 | 437416440161447 |
10 | 101241301024240 |
11 | 2a293216089053 |
12 | b4312aaa52614 |
13 | 44650241b9420 |
14 | 1b00168613d96 |
15 | ba87ba2d5a7a |
hex | 5c1413c8bdf0 |
101241301024240 has 80 divisors (see below), whose sum is σ = 253820577755808. Its totient is φ = 37333044292608.
The previous prime is 101241301024231. The next prime is 101241301024243. The reversal of 101241301024240 is 42420103142101.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101241301024243) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 62163354 + ... + 63771193.
Almost surely, 2101241301024240 is an apocalyptic number.
101241301024240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101241301024240 is an abundant number, since it is smaller than the sum of its proper divisors (152579276731568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101241301024240 is a wasteful number, since it uses less digits than its factorization.
101241301024240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 125935346 (or 125935340 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 101241301024240 its reverse (42420103142101), we get a palindrome (143661404166341).
The spelling of 101241301024240 in words is "one hundred one trillion, two hundred forty-one billion, three hundred one million, twenty-four thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •