Base | Representation |
---|---|
bin | 1011111100110111011110… |
… | …0000101000110101000010 |
3 | 1201112012102210112012012122 |
4 | 2333031313200220311002 |
5 | 3210242323330044020 |
6 | 43540324114524242 |
7 | 2524233063061511 |
oct | 277156740506502 |
9 | 51465383465178 |
10 | 13140310003010 |
11 | 420685747a773 |
12 | 158281b296682 |
13 | 74418383b238 |
14 | 335dcc8ac678 |
15 | 17bc226e1125 |
hex | bf377828d42 |
13140310003010 has 8 divisors (see below), whose sum is σ = 23652558005436. Its totient is φ = 5256124001200.
The previous prime is 13140310002959. The next prime is 13140310003039. The reversal of 13140310003010 is 1030001304131.
It can be written as a sum of positive squares in 2 ways, for example, as 11983775374081 + 1156534628929 = 3461759^2 + 1075423^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13140310003010.
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 3 ways as a sum of consecutive naturals, for example, 657015500141 + ... + 657015500160.
Almost surely, 213140310003010 is an apocalyptic number.
13140310003010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13140310003010 is a deficient number, since it is larger than the sum of its proper divisors (10512248002426).
13140310003010 is a wasteful number, since it uses less digits than its factorization.
13140310003010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1314031000308.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 13140310003010 its reverse (1030001304131), we get a palindrome (14170311307141).
The spelling of 13140310003010 in words is "thirteen trillion, one hundred forty billion, three hundred ten million, three thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •