Base | Representation |
---|---|
bin | 1001011000110001011110… |
… | …0010000010011110111001 |
3 | 1100112200211020222101222102 |
4 | 2112030113202002132321 |
5 | 2323100310002230241 |
6 | 33541254441433145 |
7 | 2113452662525450 |
oct | 226142742023671 |
9 | 40480736871872 |
10 | 10321201211321 |
11 | 331a219013170 |
12 | 11a839949b7b5 |
13 | 59b39248b690 |
14 | 279797cbdb97 |
15 | 12d728a4739b |
hex | 963178827b9 |
10321201211321 has 128 divisors (see below), whose sum is σ = 14487222435840. Its totient is φ = 7095784550400.
The previous prime is 10321201211249. The next prime is 10321201211327. The reversal of 10321201211321 is 12311210212301.
It is not a de Polignac number, because 10321201211321 - 218 = 10321200949177 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10321201211293 and 10321201211302.
It is not an unprimeable number, because it can be changed into a prime (10321201211327) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 384231431 + ... + 384258291.
It is an arithmetic number, because the mean of its divisors is an integer number (113181425280).
Almost surely, 210321201211321 is an apocalyptic number.
10321201211321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10321201211321 is a deficient number, since it is larger than the sum of its proper divisors (4166021224519).
10321201211321 is a wasteful number, since it uses less digits than its factorization.
10321201211321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27127.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 10321201211321 its reverse (12311210212301), we get a palindrome (22632411423622).
The spelling of 10321201211321 in words is "ten trillion, three hundred twenty-one billion, two hundred one million, two hundred eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •