Base | Representation |
---|---|
bin | 1100000001110110101… |
… | …00100010111110110010 |
3 | 1110111211102122020100120 |
4 | 12000323110202332302 |
5 | 23232430344233242 |
6 | 513512320431110 |
7 | 41601154621650 |
oct | 6007324427662 |
9 | 1414742566316 |
10 | 413312102322 |
11 | 14a3149a7959 |
12 | 68129478496 |
13 | 2cc8a587572 |
14 | 1600c171dd0 |
15 | ab4044a1ec |
hex | 603b522fb2 |
413312102322 has 32 divisors (see below), whose sum is σ = 975188004864. Its totient is φ = 114279843600.
The previous prime is 413312102267. The next prime is 413312102327. The reversal of 413312102322 is 223201213314.
It is a junction number, because it is equal to n+sod(n) for n = 413312102292 and 413312102301.
It is not an unprimeable number, because it can be changed into a prime (413312102327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 158720704 + ... + 158723307.
It is an arithmetic number, because the mean of its divisors is an integer number (30474625152).
Almost surely, 2413312102322 is an apocalyptic number.
413312102322 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
413312102322 is an abundant number, since it is smaller than the sum of its proper divisors (561875902542).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
413312102322 is a wasteful number, since it uses less digits than its factorization.
413312102322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317444054.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 413312102322 its reverse (223201213314), we get a palindrome (636513315636).
The spelling of 413312102322 in words is "four hundred thirteen billion, three hundred twelve million, one hundred two thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •