Base | Representation |
---|---|
bin | 100001100000010011110… |
… | …000110100000101011011 |
3 | 22011002222120211121200000 |
4 | 201200103300310011123 |
5 | 300210341103042021 |
6 | 4521420143544043 |
7 | 325226314243446 |
oct | 41402360640533 |
9 | 8132876747600 |
10 | 2302434034011 |
11 | 808502a95941 |
12 | 3122885bb023 |
13 | 139170736a97 |
14 | 7d61cd9065d |
15 | 3ed591d6b26 |
hex | 21813c3415b |
2302434034011 has 12 divisors (see below), whose sum is σ = 3448913532792. Its totient is φ = 1534956022512.
The previous prime is 2302434034007. The next prime is 2302434034081. The reversal of 2302434034011 is 1104304342032.
2302434034011 is a `hidden beast` number, since 2 + 3 + 0 + 243 + 403 + 4 + 0 + 11 = 666.
It is not a de Polignac number, because 2302434034011 - 22 = 2302434034007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (2302434034081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4737518346 + ... + 4737518831.
It is an arithmetic number, because the mean of its divisors is an integer number (287409461066).
Almost surely, 22302434034011 is an apocalyptic number.
2302434034011 is a deficient number, since it is larger than the sum of its proper divisors (1146479498781).
2302434034011 is an frugal number, since it uses more digits than its factorization.
2302434034011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9475037192 (or 9475037180 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 2302434034011 its reverse (1104304342032), we get a palindrome (3406738376043).
The spelling of 2302434034011 in words is "two trillion, three hundred two billion, four hundred thirty-four million, thirty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •