Base | Representation |
---|---|
bin | 10111000010000111001011… |
… | …111000101110001110010100 |
3 | 111021200012120210202122020222 |
4 | 113002013023320232032110 |
5 | 101234200324411223104 |
6 | 555240403002213512 |
7 | 30223461664413164 |
oct | 2702071370561624 |
9 | 437605523678228 |
10 | 101300224320404 |
11 | 2a30620281262a |
12 | b4407b41b4298 |
13 | 446a754861445 |
14 | 1b02d580b05a4 |
15 | baa0b82551be |
hex | 5c21cbe2e394 |
101300224320404 has 12 divisors (see below), whose sum is σ = 184983018324384. Its totient is φ = 48447933370584.
The previous prime is 101300224320389. The next prime is 101300224320419. The reversal of 101300224320404 is 404023422003101.
It is an interprime number because it is at equal distance from previous prime (101300224320389) and next prime (101300224320419).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 550544697302 + ... + 550544697485.
It is an arithmetic number, because the mean of its divisors is an integer number (15415251527032).
Almost surely, 2101300224320404 is an apocalyptic number.
It is an amenable number.
101300224320404 is a deficient number, since it is larger than the sum of its proper divisors (83682794003980).
101300224320404 is a wasteful number, since it uses less digits than its factorization.
101300224320404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1101089394814 (or 1101089394812 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 101300224320404 its reverse (404023422003101), we get a palindrome (505323646323505).
The spelling of 101300224320404 in words is "one hundred one trillion, three hundred billion, two hundred twenty-four million, three hundred twenty thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •