Base | Representation |
---|---|
bin | 11000101000100010… |
… | …10111010111010101 |
3 | 1021010200011112011222 |
4 | 30110101113113111 |
5 | 204041044421412 |
6 | 10024145340125 |
7 | 645504426344 |
oct | 142421272725 |
9 | 37120145158 |
10 | 13224998357 |
11 | 567719200a |
12 | 2691037645 |
13 | 1329b9c51c |
14 | 8d65b7b5b |
15 | 526098072 |
hex | 3144575d5 |
13224998357 has 2 divisors, whose sum is σ = 13224998358. Its totient is φ = 13224998356.
The previous prime is 13224998329. The next prime is 13224998399. The reversal of 13224998357 is 75389942231.
13224998357 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9854731441 + 3370266916 = 99271^2 + 58054^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13224998357 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13224998299 and 13224998308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13224998327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6612499178 + 6612499179.
It is an arithmetic number, because the mean of its divisors is an integer number (6612499179).
Almost surely, 213224998357 is an apocalyptic number.
It is an amenable number.
13224998357 is a deficient number, since it is larger than the sum of its proper divisors (1).
13224998357 is an equidigital number, since it uses as much as digits as its factorization.
13224998357 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3265920, while the sum is 53.
The spelling of 13224998357 in words is "thirteen billion, two hundred twenty-four million, nine hundred ninety-eight thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •