Base | Representation |
---|---|
bin | 1100000111011001011011… |
… | …0101100010000011010011 |
3 | 1202011111102000111122112000 |
4 | 3001312112311202003103 |
5 | 3221223331343403103 |
6 | 44155404054005043 |
7 | 2543266232301240 |
oct | 301662665420323 |
9 | 52144360448460 |
10 | 13321224200403 |
11 | 4276554860989 |
12 | 15b18ab046783 |
13 | 7582559aa392 |
14 | 340a71c7c5c7 |
15 | 1817b02ccaa3 |
hex | c1d96d620d3 |
13321224200403 has 32 divisors (see below), whose sum is σ = 22554777784320. Its totient is φ = 7612018727040.
The previous prime is 13321224200387. The next prime is 13321224200423. The reversal of 13321224200403 is 30400242212331.
13321224200403 is a `hidden beast` number, since 1 + 3 + 3 + 2 + 12 + 242 + 0 + 0 + 403 = 666.
It is not a de Polignac number, because 13321224200403 - 24 = 13321224200387 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (13321224200423) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13737723 + ... + 14675403.
It is an arithmetic number, because the mean of its divisors is an integer number (704836805760).
Almost surely, 213321224200403 is an apocalyptic number.
13321224200403 is a deficient number, since it is larger than the sum of its proper divisors (9233553583917).
13321224200403 is an equidigital number, since it uses as much as digits as its factorization.
13321224200403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1012864 (or 1012858 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 13321224200403 its reverse (30400242212331), we get a palindrome (43721466412734).
The spelling of 13321224200403 in words is "thirteen trillion, three hundred twenty-one billion, two hundred twenty-four million, two hundred thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •