Base | Representation |
---|---|
bin | 1010011000111001111111… |
… | …1000000100000010100111 |
3 | 1111110000202112101001122120 |
4 | 2212032133320010002213 |
5 | 2444123301040022043 |
6 | 40143353124201023 |
7 | 2256166411422414 |
oct | 246163770040247 |
9 | 44400675331576 |
10 | 11423000314023 |
11 | 37045159756a1 |
12 | 1345a2b839173 |
13 | 64b251c0145c |
14 | 2b6c3a2a910b |
15 | 14c212425983 |
hex | a639fe040a7 |
11423000314023 has 32 divisors (see below), whose sum is σ = 15344839372800. Its totient is φ = 7558479691776.
The previous prime is 11423000314021. The next prime is 11423000314163. The reversal of 11423000314023 is 32041300032411.
It is a happy number.
It is not a de Polignac number, because 11423000314023 - 21 = 11423000314021 is a prime.
It is a super-2 number, since 2×114230003140232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11423000313984 and 11423000314002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11423000314021) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 728546298 + ... + 728561976.
It is an arithmetic number, because the mean of its divisors is an integer number (479526230400).
Almost surely, 211423000314023 is an apocalyptic number.
11423000314023 is a deficient number, since it is larger than the sum of its proper divisors (3921839058777).
11423000314023 is a wasteful number, since it uses less digits than its factorization.
11423000314023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19271.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 11423000314023 its reverse (32041300032411), we get a palindrome (43464300346434).
The spelling of 11423000314023 in words is "eleven trillion, four hundred twenty-three billion, three hundred fourteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •