Base | Representation |
---|---|
bin | 10110111111001111100010… |
… | …110010101111010101001000 |
3 | 111020222100121200221000200122 |
4 | 112333033202302233111020 |
5 | 101222433011233214144 |
6 | 555010032340522412 |
7 | 30203311404441521 |
oct | 2677174262572510 |
9 | 436870550830618 |
10 | 101103040132424 |
11 | 2a23a616449700 |
12 | b40a5436b0408 |
13 | 4454c8ba17635 |
14 | 1ad75add6b848 |
15 | ba4dc70e07ee |
hex | 5bf3e2caf548 |
101103040132424 has 48 divisors (see below), whose sum is σ = 208370342740560. Its totient is φ = 45955488348000.
The previous prime is 101103040132403. The next prime is 101103040132447. The reversal of 101103040132424 is 424231040301101.
It is a super-2 number, since 2×1011030401324242 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101103040132393 and 101103040132402.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 114600599 + ... + 115479449.
It is an arithmetic number, because the mean of its divisors is an integer number (4341048807095).
Almost surely, 2101103040132424 is an apocalyptic number.
It is an amenable number.
101103040132424 is an abundant number, since it is smaller than the sum of its proper divisors (107267302608136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101103040132424 is a wasteful number, since it uses less digits than its factorization.
101103040132424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 997722 (or 997707 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 101103040132424 its reverse (424231040301101), we get a palindrome (525334080433525).
The spelling of 101103040132424 in words is "one hundred one trillion, one hundred three billion, forty million, one hundred thirty-two thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •