Base | Representation |
---|---|
bin | 100001111010111010011… |
… | …111001110011100000101 |
3 | 22020211201110122222102002 |
4 | 201322322133032130011 |
5 | 301142342230202323 |
6 | 4542502545355045 |
7 | 330260243525363 |
oct | 41727237163405 |
9 | 8224643588362 |
10 | 2331001022213 |
11 | 8196323429a6 |
12 | 31791b638a85 |
13 | 13ba73c625b6 |
14 | 80b6cd72633 |
15 | 4097c0e9828 |
hex | 21eba7ce705 |
2331001022213 has 32 divisors (see below), whose sum is σ = 2715198796800. Its totient is φ = 1984953966336.
The previous prime is 2331001022177. The next prime is 2331001022297. The reversal of 2331001022213 is 3122201001332.
It is a cyclic number.
It is not a de Polignac number, because 2331001022213 - 210 = 2331001021189 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2331001021213) 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 31 ways as a sum of consecutive naturals, for example, 4532858 + ... + 5020836.
It is an arithmetic number, because the mean of its divisors is an integer number (84849962400).
Almost surely, 22331001022213 is an apocalyptic number.
2331001022213 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2331001022213 is a deficient number, since it is larger than the sum of its proper divisors (384197774587).
2331001022213 is a wasteful number, since it uses less digits than its factorization.
2331001022213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488681.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2331001022213 its reverse (3122201001332), we get a palindrome (5453202023545).
The spelling of 2331001022213 in words is "two trillion, three hundred thirty-one billion, one million, twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •