Base | Representation |
---|---|
bin | 1001010001110011111100… |
… | …01110101111101010000001 |
3 | 2200020112020221211021012020 |
4 | 10220321332032233222001 |
5 | 10133241234341403213 |
6 | 111221034552152053 |
7 | 4204040424216411 |
oct | 450717616575201 |
9 | 80215227737166 |
10 | 20403212450433 |
11 | 6556a54576a4a |
12 | 2356342698629 |
13 | b5002632c907 |
14 | 507740d2a641 |
15 | 255b037db923 |
hex | 128e7e3afa81 |
20403212450433 has 8 divisors (see below), whose sum is σ = 27204700177728. Its totient is φ = 13601933178384.
The previous prime is 20403212450351. The next prime is 20403212450479. The reversal of 20403212450433 is 33405421230402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20403212450433 - 213 = 20403212442241 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20403212450394 and 20403212450403.
It is not an unprimeable number, because it can be changed into a prime (20403212450833) 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, 51885285 + ... + 52277042.
It is an arithmetic number, because the mean of its divisors is an integer number (3400587522216).
Almost surely, 220403212450433 is an apocalyptic number.
It is an amenable number.
20403212450433 is a deficient number, since it is larger than the sum of its proper divisors (6801487727295).
20403212450433 is a wasteful number, since it uses less digits than its factorization.
20403212450433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104227623.
The product of its (nonzero) digits is 69120, while the sum is 33.
Adding to 20403212450433 its reverse (33405421230402), we get a palindrome (53808633680835).
The spelling of 20403212450433 in words is "twenty trillion, four hundred three billion, two hundred twelve million, four hundred fifty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •