Base | Representation |
---|---|
bin | 1011110111010000101100… |
… | …0011101101110000110011 |
3 | 1201011222211212112010222010 |
4 | 2331310023003231300303 |
5 | 3202203103301414303 |
6 | 43424155331014003 |
7 | 2514253336551000 |
oct | 275641303556063 |
9 | 51158755463863 |
10 | 13044001201203 |
11 | 4179a25692495 |
12 | 156802173a303 |
13 | 73807599004b |
14 | 331493b7a8a7 |
15 | 17948757ec03 |
hex | bdd0b0edc33 |
13044001201203 has 16 divisors (see below), whose sum is σ = 20282217612800. Its totient is φ = 7453714971528.
The previous prime is 13044001201129. The next prime is 13044001201271. The reversal of 13044001201203 is 30210210044031.
It is not a de Polignac number, because 13044001201203 - 29 = 13044001200691 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13044001201203.
It is not an unprimeable number, because it can be changed into a prime (13044001201603) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6338191975 + ... + 6338194032.
It is an arithmetic number, because the mean of its divisors is an integer number (1267638600800).
Almost surely, 213044001201203 is an apocalyptic number.
13044001201203 is a deficient number, since it is larger than the sum of its proper divisors (7238216411597).
13044001201203 is an equidigital number, since it uses as much as digits as its factorization.
13044001201203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12676386031 (or 12676386017 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 13044001201203 its reverse (30210210044031), we get a palindrome (43254211245234).
The spelling of 13044001201203 in words is "thirteen trillion, forty-four billion, one million, two hundred one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •