Base | Representation |
---|---|
bin | 11000011000000111000110… |
… | …010001000011000001100110 |
3 | 112001121011202120210112100110 |
4 | 120120013012101003001212 |
5 | 103023012042242024222 |
6 | 1020003332452553450 |
7 | 31403444603553201 |
oct | 3030070621030146 |
9 | 461534676715313 |
10 | 107210005033062 |
11 | 31184564978088 |
12 | 10036025922886 |
13 | 47a8b24820a39 |
14 | 1c68dc5bdc938 |
15 | c5dba199730c |
hex | 6181c6443066 |
107210005033062 has 128 divisors (see below), whose sum is σ = 224704011087360. Its totient is φ = 34056804741120.
The previous prime is 107210005033009. The next prime is 107210005033063. The reversal of 107210005033062 is 260330500012701.
It is a super-2 number, since 2×1072100050330622 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107210005033063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 13514430048 + ... + 13514437980.
It is an arithmetic number, because the mean of its divisors is an integer number (1755500086620).
Almost surely, 2107210005033062 is an apocalyptic number.
107210005033062 is an abundant number, since it is smaller than the sum of its proper divisors (117494006054298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107210005033062 is a wasteful number, since it uses less digits than its factorization.
107210005033062 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10118.
The product of its (nonzero) digits is 7560, while the sum is 30.
Adding to 107210005033062 its reverse (260330500012701), we get a palindrome (367540505045763).
The spelling of 107210005033062 in words is "one hundred seven trillion, two hundred ten billion, five million, thirty-three thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •