Base | Representation |
---|---|
bin | 1100010001111010111010… |
… | …1101100111100011110111 |
3 | 1202210210001112021211112112 |
4 | 3010132232231213203313 |
5 | 3232204110412433211 |
6 | 44414423410041235 |
7 | 2562326323214525 |
oct | 304365655474367 |
9 | 52723045254475 |
10 | 13502013405431 |
11 | 4336198630521 |
12 | 1620944b7921b |
13 | 76c307c95145 |
14 | 3497027d3315 |
15 | 186341e2988b |
hex | c47aeb678f7 |
13502013405431 has 8 divisors (see below), whose sum is σ = 13510304586240. Its totient is φ = 13493724344928.
The previous prime is 13502013405427. The next prime is 13502013405467. The reversal of 13502013405431 is 13450431020531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13502013405431 - 22 = 13502013405427 is a prime.
It is a super-2 number, since 2×135020134054312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13502013405631) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12304970 + ... + 13357256.
It is an arithmetic number, because the mean of its divisors is an integer number (1688788073280).
Almost surely, 213502013405431 is an apocalyptic number.
13502013405431 is a deficient number, since it is larger than the sum of its proper divisors (8291180809).
13502013405431 is a wasteful number, since it uses less digits than its factorization.
13502013405431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1060153.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 13502013405431 its reverse (13450431020531), we get a palindrome (26952444425962).
The spelling of 13502013405431 in words is "thirteen trillion, five hundred two billion, thirteen million, four hundred five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •