Base | Representation |
---|---|
bin | 10011000110111100001… |
… | …110110000010111101110 |
3 | 11122112101210121102201200 |
4 | 103012330032300113232 |
5 | 133003233442310110 |
6 | 2443123531150330 |
7 | 163604261265006 |
oct | 23067416602756 |
9 | 4575353542650 |
10 | 1313123010030 |
11 | 46698a784927 |
12 | 1925aa2a53a6 |
13 | 96a99b08130 |
14 | 477ac3b5006 |
15 | 242560746c0 |
hex | 131bc3b05ee |
1313123010030 has 96 divisors (see below), whose sum is σ = 3870257358240. Its totient is φ = 306218154240.
The previous prime is 1313123009999. The next prime is 1313123010041. The reversal of 1313123010030 is 300103213131.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1313123009985 and 1313123010012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 29512701 + ... + 29557160.
It is an arithmetic number, because the mean of its divisors is an integer number (40315180815).
Almost surely, 21313123010030 is an apocalyptic number.
1313123010030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1313123010030 is an abundant number, since it is smaller than the sum of its proper divisors (2557134348210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1313123010030 is a wasteful number, since it uses less digits than its factorization.
1313123010030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59069906 (or 59069903 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 1313123010030 its reverse (300103213131), we get a palindrome (1613226223161).
The spelling of 1313123010030 in words is "one trillion, three hundred thirteen billion, one hundred twenty-three million, ten thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •