Base | Representation |
---|---|
bin | 10111100011110010101011… |
… | …000100000100111100011110 |
3 | 111120212110112212201220210020 |
4 | 113203302223010010330132 |
5 | 102040110311210141340 |
6 | 1004211530153053010 |
7 | 30552624614652234 |
oct | 2743625304047436 |
9 | 446773485656706 |
10 | 103614661021470 |
11 | 30018804a10915 |
12 | b7552703b7166 |
13 | 45a7a88b54981 |
14 | 1b82d95174954 |
15 | bea3c60379d0 |
hex | 5e3cab104f1e |
103614661021470 has 32 divisors (see below), whose sum is σ = 250633258795008. Its totient is φ = 27413012678688.
The previous prime is 103614661021447. The next prime is 103614661021471. The reversal of 103614661021470 is 74120166416301.
It is a super-3 number, since 3×1036146610214703 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103614661021471) 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, 13597720734 + ... + 13597728353.
It is an arithmetic number, because the mean of its divisors is an integer number (7832289337344).
Almost surely, 2103614661021470 is an apocalyptic number.
103614661021470 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103614661021470 is an abundant number, since it is smaller than the sum of its proper divisors (147018597773538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103614661021470 is a wasteful number, since it uses less digits than its factorization.
103614661021470 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27195449224.
The product of its (nonzero) digits is 145152, while the sum is 42.
The spelling of 103614661021470 in words is "one hundred three trillion, six hundred fourteen billion, six hundred sixty-one million, twenty-one thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •