Base | Representation |
---|---|
bin | 1010011010100010110101… |
… | …1111100000101001000111 |
3 | 1111112201102001112101112002 |
4 | 2212220231133200221013 |
5 | 3000103421341433043 |
6 | 40204330041015515 |
7 | 2261214034252205 |
oct | 246505537405107 |
9 | 44481361471462 |
10 | 11451146046023 |
11 | 3715449459732 |
12 | 134b38578459b |
13 | 650ab9085548 |
14 | 2b834a352075 |
15 | 14cd0d376bb8 |
hex | a6a2d7e0a47 |
11451146046023 has 2 divisors, whose sum is σ = 11451146046024. Its totient is φ = 11451146046022.
The previous prime is 11451146046013. The next prime is 11451146046061. The reversal of 11451146046023 is 32064064115411.
11451146046023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (11451146046061) can be obtained adding 11451146046023 to its sum of digits (38).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11451146046023 - 24 = 11451146046007 is a prime.
It is a super-2 number, since 2×114511460460232 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11451146046013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5725573023011 + 5725573023012.
It is an arithmetic number, because the mean of its divisors is an integer number (5725573023012).
Almost surely, 211451146046023 is an apocalyptic number.
11451146046023 is a deficient number, since it is larger than the sum of its proper divisors (1).
11451146046023 is an equidigital number, since it uses as much as digits as its factorization.
11451146046023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 69120, while the sum is 38.
The spelling of 11451146046023 in words is "eleven trillion, four hundred fifty-one billion, one hundred forty-six million, forty-six thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •