Base | Representation |
---|---|
bin | 1011111100011000111111… |
… | …1100110111010100101011 |
3 | 1201111102022201122010120210 |
4 | 2333012033330313110223 |
5 | 3210124100302333003 |
6 | 43532452311352203 |
7 | 2523523266164145 |
oct | 277061774672453 |
9 | 51442281563523 |
10 | 13132130121003 |
11 | 420333a110303 |
12 | 1581117982663 |
13 | 74347bc65b7a |
14 | 33585437bc95 |
15 | 17b8e4512503 |
hex | bf18ff3752b |
13132130121003 has 8 divisors (see below), whose sum is σ = 17539335632448. Its totient is φ = 8739839011784.
The previous prime is 13132130120983. The next prime is 13132130121023. The reversal of 13132130121003 is 30012103123131.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (13132130120983) and next prime (13132130121023).
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 13132130121003 - 217 = 13132129989931 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13132130121023) 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, 3728598501 + ... + 3728602022.
It is an arithmetic number, because the mean of its divisors is an integer number (2192416954056).
Almost surely, 213132130121003 is an apocalyptic number.
13132130121003 is a deficient number, since it is larger than the sum of its proper divisors (4407205511445).
13132130121003 is an equidigital number, since it uses as much as digits as its factorization.
13132130121003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7457201113.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 13132130121003 its reverse (30012103123131), we get a palindrome (43144233244134).
The spelling of 13132130121003 in words is "thirteen trillion, one hundred thirty-two billion, one hundred thirty million, one hundred twenty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •