Base | Representation |
---|---|
bin | 10111011101111100110010… |
… | …110110000000110111111011 |
3 | 111112110002100012210020100220 |
4 | 113131330302312000313323 |
5 | 102012021124300012311 |
6 | 1003303254533431123 |
7 | 30511623420344421 |
oct | 2735746266006773 |
9 | 445402305706326 |
10 | 103213212110331 |
11 | 2a9835285230a4 |
12 | b6ab4b3a9b4a3 |
13 | 4578c6c2a127b |
14 | 1b6b7907ab111 |
15 | bdec2c337206 |
hex | 5ddf32d80dfb |
103213212110331 has 16 divisors (see below), whose sum is σ = 138226531968000. Its totient is φ = 68504384796768.
The previous prime is 103213212110299. The next prime is 103213212110339. The reversal of 103213212110331 is 133011212312301.
It is not a de Polignac number, because 103213212110331 - 25 = 103213212110299 is a prime.
It is a super-2 number, since 2×1032132121103312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103213212110339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7624470 + ... + 16265268.
It is an arithmetic number, because the mean of its divisors is an integer number (8639158248000).
Almost surely, 2103213212110331 is an apocalyptic number.
103213212110331 is a deficient number, since it is larger than the sum of its proper divisors (35013319857669).
103213212110331 is a wasteful number, since it uses less digits than its factorization.
103213212110331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8658418.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 103213212110331 its reverse (133011212312301), we get a palindrome (236224424422632).
The spelling of 103213212110331 in words is "one hundred three trillion, two hundred thirteen billion, two hundred twelve million, one hundred ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •