Base | Representation |
---|---|
bin | 10001110101011000101… |
… | …001110011010011110001 |
3 | 11100011100220020122200002 |
4 | 101311120221303103301 |
5 | 130034413034014213 |
6 | 2335002234435345 |
7 | 154354226615612 |
oct | 21653051632361 |
9 | 4304326218602 |
10 | 1225553032433 |
11 | 432832811614 |
12 | 17962b292b55 |
13 | 8b752583a42 |
14 | 4346210dc09 |
15 | 21d2d1ee658 |
hex | 11d58a734f1 |
1225553032433 has 8 divisors (see below), whose sum is σ = 1297710622152. Its totient is φ = 1153402802176.
The previous prime is 1225553032427. The next prime is 1225553032453. The reversal of 1225553032433 is 3342303555221.
It can be written as a sum of positive squares in 4 ways, for example, as 597704704 + 1224955327729 = 24448^2 + 1106777^2 .
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 1225553032433 - 28 = 1225553032177 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1225553032453) 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, 1495160 + ... + 2164857.
It is an arithmetic number, because the mean of its divisors is an integer number (162213827769).
Almost surely, 21225553032433 is an apocalyptic number.
It is an amenable number.
1225553032433 is a deficient number, since it is larger than the sum of its proper divisors (72157589719).
1225553032433 is a wasteful number, since it uses less digits than its factorization.
1225553032433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3679731.
The product of its (nonzero) digits is 324000, while the sum is 38.
Adding to 1225553032433 its reverse (3342303555221), we get a palindrome (4567856587654).
The spelling of 1225553032433 in words is "one trillion, two hundred twenty-five billion, five hundred fifty-three million, thirty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •