Base | Representation |
---|---|
bin | 110000101000101101101… |
… | …001101011000000111111 |
3 | 102211111221011212210201201 |
4 | 300220231221223000333 |
5 | 414224412104030403 |
6 | 11035224134320331 |
7 | 463320040061020 |
oct | 60505551530077 |
9 | 12744834783651 |
10 | 3342250455103 |
11 | 107949328226a |
12 | 45b900ab90a7 |
13 | 1b3232a29cb1 |
14 | b7aa1458c47 |
15 | 5be1627121d |
hex | 30a2da6b03f |
3342250455103 has 32 divisors (see below), whose sum is σ = 3942140590080. Its totient is φ = 2774078115840.
The previous prime is 3342250455101. The next prime is 3342250455113. The reversal of 3342250455103 is 3015540522433.
3342250455103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3342250455103 - 21 = 3342250455101 is a prime.
It is a super-2 number, since 2×33422504551032 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3342250455101) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24247926 + ... + 24385372.
It is an arithmetic number, because the mean of its divisors is an integer number (123191893440).
Almost surely, 23342250455103 is an apocalyptic number.
3342250455103 is a deficient number, since it is larger than the sum of its proper divisors (599890134977).
3342250455103 is a wasteful number, since it uses less digits than its factorization.
3342250455103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138127.
The product of its (nonzero) digits is 216000, while the sum is 37.
Adding to 3342250455103 its reverse (3015540522433), we get a palindrome (6357790977536).
The spelling of 3342250455103 in words is "three trillion, three hundred forty-two billion, two hundred fifty million, four hundred fifty-five thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •