Base | Representation |
---|---|
bin | 11000010011000000… |
… | …00111000001101111 |
3 | 1020200002011211011000 |
4 | 30021200013001233 |
5 | 203203321023343 |
6 | 5554212531343 |
7 | 641151561423 |
oct | 141140070157 |
9 | 36602154130 |
10 | 13044314223 |
11 | 55941a2386 |
12 | 2640620b53 |
13 | 12cb619135 |
14 | 8ba5c2b83 |
15 | 5152a6ed3 |
hex | 30980706f |
13044314223 has 8 divisors (see below), whose sum is σ = 19324910000. Its totient is φ = 8696209464.
The previous prime is 13044314201. The next prime is 13044314233. The reversal of 13044314223 is 32241344031.
13044314223 is a `hidden beast` number, since 1 + 3 + 0 + 4 + 431 + 4 + 223 = 666.
It is not a de Polignac number, because 13044314223 - 25 = 13044314191 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 483122749 = 13044314223 / (1 + 3 + 0 + 4 + 4 + 3 + 1 + 4 + 2 + 2 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13044314233) 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, 241561348 + ... + 241561401.
It is an arithmetic number, because the mean of its divisors is an integer number (2415613750).
Almost surely, 213044314223 is an apocalyptic number.
13044314223 is a deficient number, since it is larger than the sum of its proper divisors (6280595777).
13044314223 is an equidigital number, since it uses as much as digits as its factorization.
13044314223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 483122758 (or 483122752 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 13044314223 its reverse (32241344031), we get a palindrome (45285658254).
The spelling of 13044314223 in words is "thirteen billion, forty-four million, three hundred fourteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •