Base | Representation |
---|---|
bin | 1011111011010110111101… |
… | …0001111100110111100110 |
3 | 1201102201120020021221201101 |
4 | 2332311233101330313212 |
5 | 3204331243421201210 |
6 | 43520401223150314 |
7 | 2522325052565305 |
oct | 276655721746746 |
9 | 51381506257641 |
10 | 13114402131430 |
11 | 41a6872125356 |
12 | 15797aa8a539a |
13 | 7418b51b3502 |
14 | 334a51b1a43c |
15 | 17b207e89a3a |
hex | bed6f47cde6 |
13114402131430 has 8 divisors (see below), whose sum is σ = 23605923836592. Its totient is φ = 5245760852568.
The previous prime is 13114402131403. The next prime is 13114402131469. The reversal of 13114402131430 is 3413120441131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 655720106562 + ... + 655720106581.
It is an arithmetic number, because the mean of its divisors is an integer number (2950740479574).
Almost surely, 213114402131430 is an apocalyptic number.
13114402131430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13114402131430 is a deficient number, since it is larger than the sum of its proper divisors (10491521705162).
13114402131430 is a wasteful number, since it uses less digits than its factorization.
13114402131430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1311440213150.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 13114402131430 its reverse (3413120441131), we get a palindrome (16527522572561).
The spelling of 13114402131430 in words is "thirteen trillion, one hundred fourteen billion, four hundred two million, one hundred thirty-one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •