Base | Representation |
---|---|
bin | 10011000100010101111… |
… | …100001101100011111010 |
3 | 11122021012100221220011210 |
4 | 103010111330031203322 |
5 | 132432030240143002 |
6 | 2441543030303550 |
7 | 163445163561630 |
oct | 23042574154372 |
9 | 4567170856153 |
10 | 1310333131002 |
11 | 46578898a485 |
12 | 191b4bab7bb6 |
13 | 96743b1283c |
14 | 475c5a67350 |
15 | 2414118896c |
hex | 13115f0d8fa |
1310333131002 has 128 divisors (see below), whose sum is σ = 3105119232000. Its totient is φ = 360829852416.
The previous prime is 1310333130983. The next prime is 1310333131067. The reversal of 1310333131002 is 2001313330131.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1310333131002.
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, 70808083 + ... + 70826585.
It is an arithmetic number, because the mean of its divisors is an integer number (24258744000).
Almost surely, 21310333131002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1310333131002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1552559616000).
1310333131002 is an abundant number, since it is smaller than the sum of its proper divisors (1794786100998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1310333131002 is a wasteful number, since it uses less digits than its factorization.
1310333131002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18980.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1310333131002 its reverse (2001313330131), we get a palindrome (3311646461133).
The spelling of 1310333131002 in words is "one trillion, three hundred ten billion, three hundred thirty-three million, one hundred thirty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •