Base | Representation |
---|---|
bin | 10010111101110011010… |
… | …101011110011010100100 |
3 | 11121121001220212221222100 |
4 | 102331303111132122210 |
5 | 132323134341201012 |
6 | 2434422110332100 |
7 | 163106145031155 |
oct | 22756325363244 |
9 | 4547056787870 |
10 | 1303310100132 |
11 | 462804635437 |
12 | 19070baba030 |
13 | 95b94b04a81 |
14 | 4711b03392c |
15 | 23d7e8208dc |
hex | 12f7355e6a4 |
1303310100132 has 36 divisors (see below), whose sum is σ = 3467871905680. Its totient is φ = 411571610352.
The previous prime is 1303310100067. The next prime is 1303310100161. The reversal of 1303310100132 is 2310010133031.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (18).
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 11 ways as a sum of consecutive naturals, for example, 952711378 + ... + 952712745.
Almost surely, 21303310100132 is an apocalyptic number.
1303310100132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1303310100132 is an abundant number, since it is smaller than the sum of its proper divisors (2164561805548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1303310100132 is a wasteful number, since it uses less digits than its factorization.
1303310100132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1905424152 (or 1905424147 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 1303310100132 its reverse (2310010133031), we get a palindrome (3613320233163).
The spelling of 1303310100132 in words is "one trillion, three hundred three billion, three hundred ten million, one hundred thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •