Base | Representation |
---|---|
bin | 11101110000110110110… |
… | …000001110010111101011 |
3 | 21020112100002011001112121 |
4 | 131300312300032113223 |
5 | 232002310144404311 |
6 | 4203335231052111 |
7 | 300525004011400 |
oct | 35606660162753 |
9 | 7215302131477 |
10 | 2045323044331 |
11 | 71946459a916 |
12 | 290492671037 |
13 | 11ab473812b8 |
14 | 70dcbdb02a7 |
15 | 3830be7cb71 |
hex | 1dc36c0e5eb |
2045323044331 has 24 divisors (see below), whose sum is σ = 2476396815120. Its totient is φ = 1682296402752.
The previous prime is 2045323044329. The next prime is 2045323044379. The reversal of 2045323044331 is 1334403235402.
It is not a de Polignac number, because 2045323044331 - 21 = 2045323044329 is a prime.
It is a super-2 number, since 2×20453230443312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2045323044931) 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 23 ways as a sum of consecutive naturals, for example, 4183576 + ... + 4646821.
It is an arithmetic number, because the mean of its divisors is an integer number (103183200630).
Almost surely, 22045323044331 is an apocalyptic number.
2045323044331 is a deficient number, since it is larger than the sum of its proper divisors (431073770789).
2045323044331 is a wasteful number, since it uses less digits than its factorization.
2045323044331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8830603 (or 8830596 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 34.
Adding to 2045323044331 its reverse (1334403235402), we get a palindrome (3379726279733).
The spelling of 2045323044331 in words is "two trillion, forty-five billion, three hundred twenty-three million, forty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •