Base | Representation |
---|---|
bin | 10010111101100111011… |
… | …011010110010100001110 |
3 | 11121120112222221201212110 |
4 | 102331213123112110032 |
5 | 132322232220010410 |
6 | 2434350212244450 |
7 | 163101200622105 |
oct | 22754733262416 |
9 | 4546488851773 |
10 | 1303110313230 |
11 | 4627118885a0 |
12 | 190675010726 |
13 | 95b625c377b |
14 | 470dc6a903c |
15 | 23d6c009720 |
hex | 12f676d650e |
1303110313230 has 32 divisors (see below), whose sum is σ = 3411779730048. Its totient is φ = 315905530400.
The previous prime is 1303110313199. The next prime is 1303110313291. The reversal of 1303110313230 is 323130113031.
It is a junction number, because it is equal to n+sod(n) for n = 1303110313197 and 1303110313206.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1974409236 + ... + 1974409895.
It is an arithmetic number, because the mean of its divisors is an integer number (106618116564).
Almost surely, 21303110313230 is an apocalyptic number.
1303110313230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1303110313230 is an abundant number, since it is smaller than the sum of its proper divisors (2108669416818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1303110313230 is a wasteful number, since it uses less digits than its factorization.
1303110313230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3948819152.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1303110313230 its reverse (323130113031), we get a palindrome (1626240426261).
The spelling of 1303110313230 in words is "one trillion, three hundred three billion, one hundred ten million, three hundred thirteen thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •