Base | Representation |
---|---|
bin | 10011111001011111111… |
… | …111100100100001110100 |
3 | 11211201112011100100200010 |
4 | 103321133333210201310 |
5 | 134400423441202330 |
6 | 2524102440020220 |
7 | 200535461035224 |
oct | 23713777444164 |
9 | 4751464310603 |
10 | 1367410100340 |
11 | 487a08398319 |
12 | 1a101aa61670 |
13 | 9bc3bac728b |
14 | 4a27c22c084 |
15 | 25881e9d3b0 |
hex | 13e5ffe4874 |
1367410100340 has 96 divisors (see below), whose sum is σ = 3846841165440. Its totient is φ = 362923603456.
The previous prime is 1367410100323. The next prime is 1367410100387. The reversal of 1367410100340 is 430010147631.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 1367410100298 and 1367410100307.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10837054 + ... + 10962506.
It is an arithmetic number, because the mean of its divisors is an integer number (40071262140).
Almost surely, 21367410100340 is an apocalyptic number.
1367410100340 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1367410100340 is an abundant number, since it is smaller than the sum of its proper divisors (2479431065100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1367410100340 is a wasteful number, since it uses less digits than its factorization.
1367410100340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126321 (or 126319 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 30.
Adding to 1367410100340 its reverse (430010147631), we get a palindrome (1797420247971).
The spelling of 1367410100340 in words is "one trillion, three hundred sixty-seven billion, four hundred ten million, one hundred thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •