Base | Representation |
---|---|
bin | 1001011000110110100000… |
… | …1000001111111110100111 |
3 | 1100112211022111100222110210 |
4 | 2112031220020033332213 |
5 | 2323111042132432401 |
6 | 33542040543550503 |
7 | 2113531332142215 |
oct | 226155010177647 |
9 | 40484274328423 |
10 | 10322553405351 |
11 | 331a85231a5a0 |
12 | 11a86b62bb433 |
13 | 59b54966c5a5 |
14 | 279885709cb5 |
15 | 12d7a75e74d6 |
hex | 9636820ffa7 |
10322553405351 has 16 divisors (see below), whose sum is σ = 15498965818368. Its totient is φ = 6054283521600.
The previous prime is 10322553405211. The next prime is 10322553405371. The reversal of 10322553405351 is 15350435522301.
It is not a de Polignac number, because 10322553405351 - 210 = 10322553404327 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10322553405371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5045235246 + ... + 5045237291.
It is an arithmetic number, because the mean of its divisors is an integer number (968685363648).
Almost surely, 210322553405351 is an apocalyptic number.
10322553405351 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10322553405351 is a deficient number, since it is larger than the sum of its proper divisors (5176412413017).
10322553405351 is a wasteful number, since it uses less digits than its factorization.
10322553405351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10090472582.
The product of its (nonzero) digits is 270000, while the sum is 39.
Adding to 10322553405351 its reverse (15350435522301), we get a palindrome (25672988927652).
The spelling of 10322553405351 in words is "ten trillion, three hundred twenty-two billion, five hundred fifty-three million, four hundred five thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •