Base | Representation |
---|---|
bin | 1011111100111110001110… |
… | …1010000011010100011100 |
3 | 1201112101010020122121212201 |
4 | 2333033203222003110130 |
5 | 3210310032322111030 |
6 | 43541224131541244 |
7 | 2524326044222305 |
oct | 277174352032434 |
9 | 51471106577781 |
10 | 13142124410140 |
11 | 42075a86846a0 |
12 | 1583046a5a824 |
13 | 7443b2703b1b |
14 | 3361218557ac |
15 | 17bccbb432ca |
hex | bf3e3a8351c |
13142124410140 has 48 divisors (see below), whose sum is σ = 30127714727040. Its totient is φ = 4775731721280.
The previous prime is 13142124410123. The next prime is 13142124410161. The reversal of 13142124410140 is 4101442124131.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 13142124410099 and 13142124410108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19814310 + ... + 20466829.
It is an arithmetic number, because the mean of its divisors is an integer number (627660723480).
Almost surely, 213142124410140 is an apocalyptic number.
13142124410140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13142124410140 is an abundant number, since it is smaller than the sum of its proper divisors (16985590316900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13142124410140 is a wasteful number, since it uses less digits than its factorization.
13142124410140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40282642 (or 40282640 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 13142124410140 its reverse (4101442124131), we get a palindrome (17243566534271).
The spelling of 13142124410140 in words is "thirteen trillion, one hundred forty-two billion, one hundred twenty-four million, four hundred ten thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •