Base | Representation |
---|---|
bin | 10111011101111100111000… |
… | …110111101001000011001010 |
3 | 111112110002121021000010202221 |
4 | 113131330320313221003022 |
5 | 102012021331134402310 |
6 | 1003303312544244254 |
7 | 30511626055526434 |
oct | 2735747067510312 |
9 | 445402537003687 |
10 | 103213313200330 |
11 | 2a98357a599553 |
12 | b6ab52191068a |
13 | 4578c87206c38 |
14 | 1b6b79dda3654 |
15 | bdec36154ada |
hex | 5ddf38de90ca |
103213313200330 has 128 divisors (see below), whose sum is σ = 192320196203520. Its totient is φ = 39858567920640.
The previous prime is 103213313200307. The next prime is 103213313200381. The reversal of 103213313200330 is 33002313312301.
It is a junction number, because it is equal to n+sod(n) for n = 103213313200295 and 103213313200304.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10443515569 + ... + 10443525451.
It is an arithmetic number, because the mean of its divisors is an integer number (1502501532840).
Almost surely, 2103213313200330 is an apocalyptic number.
103213313200330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103213313200330 is a deficient number, since it is larger than the sum of its proper divisors (89106883003190).
103213313200330 is a wasteful number, since it uses less digits than its factorization.
103213313200330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10916.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 103213313200330 its reverse (33002313312301), we get a palindrome (136215626512631).
The spelling of 103213313200330 in words is "one hundred three trillion, two hundred thirteen billion, three hundred thirteen million, two hundred thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •