Base | Representation |
---|---|
bin | 1010011000010110010100… |
… | …0001111110111001000000 |
3 | 1111102010001002012101211011 |
4 | 2212011211001332321000 |
5 | 2443444142304432112 |
6 | 40135130523530304 |
7 | 2255410156563616 |
oct | 246054501767100 |
9 | 44363032171734 |
10 | 11413423124032 |
11 | 3700450896046 |
12 | 1343bb8389994 |
13 | 64a3869b0a27 |
14 | 2b65ac3676b6 |
15 | 14bd51734aa7 |
hex | a616507ee40 |
11413423124032 has 28 divisors (see below), whose sum is σ = 22649358473100. Its totient is φ = 5706498154496.
The previous prime is 11413423124027. The next prime is 11413423124039. The reversal of 11413423124032 is 23042132431411.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 2577643094016 + 8835780030016 = 1605504^2 + 2972504^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11413423123985 and 11413423124003.
It is not an unprimeable number, because it can be changed into a prime (11413423124039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1602733 + ... + 5039404.
Almost surely, 211413423124032 is an apocalyptic number.
It is an amenable number.
11413423124032 is a deficient number, since it is larger than the sum of its proper divisors (11235935349068).
11413423124032 is an equidigital number, since it uses as much as digits as its factorization.
11413423124032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6668998 (or 6668988 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 11413423124032 its reverse (23042132431411), we get a palindrome (34455555555443).
The spelling of 11413423124032 in words is "eleven trillion, four hundred thirteen billion, four hundred twenty-three million, one hundred twenty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •