Base | Representation |
---|---|
bin | 1010011000001110110111… |
… | …0101101001100101010011 |
3 | 1111101220212201101000100011 |
4 | 2212003231311221211103 |
5 | 2443431043342333243 |
6 | 40134200250535351 |
7 | 2255306465331310 |
oct | 246035565514523 |
9 | 44356781330304 |
10 | 11411423402323 |
11 | 36aa61501957a |
12 | 134373a737557 |
13 | 64a128603249 |
14 | 2b645c941d07 |
15 | 14bc85dc989d |
hex | a60edd69953 |
11411423402323 has 16 divisors (see below), whose sum is σ = 13492990382080. Its totient is φ = 9444134800800.
The previous prime is 11411423402297. The next prime is 11411423402371. The reversal of 11411423402323 is 32320432411411.
It is a happy number.
It is not a de Polignac number, because 11411423402323 - 221 = 11411421305171 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11411423403323) 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 15 ways as a sum of consecutive naturals, for example, 59799048 + ... + 59989573.
It is an arithmetic number, because the mean of its divisors is an integer number (843311898880).
Almost surely, 211411423402323 is an apocalyptic number.
11411423402323 is a deficient number, since it is larger than the sum of its proper divisors (2081566979757).
11411423402323 is a wasteful number, since it uses less digits than its factorization.
11411423402323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119789098.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 11411423402323 its reverse (32320432411411), we get a palindrome (43731855813734).
The spelling of 11411423402323 in words is "eleven trillion, four hundred eleven billion, four hundred twenty-three million, four hundred two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •