Base | Representation |
---|---|
bin | 10111010001010000111000… |
… | …000110110010000111100011 |
3 | 111102100202002122221121202110 |
4 | 113101100320012302013203 |
5 | 101403230213020000311 |
6 | 1001355000014450403 |
7 | 30361631562055500 |
oct | 2721207006620743 |
9 | 442322078847673 |
10 | 102341422031331 |
11 | 2a6778317794aa |
12 | b58a553203a03 |
13 | 45149a7081b12 |
14 | 1b3b4cbbba4a7 |
15 | bc72066da8a6 |
hex | 5d14381b21e3 |
102341422031331 has 12 divisors (see below), whose sum is σ = 158733634171272. Its totient is φ = 58480812589248.
The previous prime is 102341422031273. The next prime is 102341422031339. The reversal of 102341422031331 is 133130224143201.
It is not a de Polignac number, because 102341422031331 - 217 = 102341421900259 is a prime.
It is a super-2 number, since 2×1023414220313312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102341422031339) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 348100074790 + ... + 348100075083.
It is an arithmetic number, because the mean of its divisors is an integer number (13227802847606).
Almost surely, 2102341422031331 is an apocalyptic number.
102341422031331 is a deficient number, since it is larger than the sum of its proper divisors (56392212139941).
102341422031331 is an equidigital number, since it uses as much as digits as its factorization.
102341422031331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 696200149890 (or 696200149883 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 102341422031331 its reverse (133130224143201), we get a palindrome (235471646174532).
The spelling of 102341422031331 in words is "one hundred two trillion, three hundred forty-one billion, four hundred twenty-two million, thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •