Base | Representation |
---|---|
bin | 1010000001001011010011… |
… | …0111101000110110000011 |
3 | 1110000001111022221102112011 |
4 | 2200102310313220312003 |
5 | 2420433344120143133 |
6 | 35232212324113351 |
7 | 2214555106326544 |
oct | 240226467506603 |
9 | 43001438842464 |
10 | 11015330631043 |
11 | 3567636a76a22 |
12 | 129aa17b35857 |
13 | 61b98360417b |
14 | 2a12056644cb |
15 | 14180252d6cd |
hex | a04b4de8d83 |
11015330631043 has 16 divisors (see below), whose sum is σ = 11571118376256. Its totient is φ = 10465990254720.
The previous prime is 11015330631031. The next prime is 11015330631047. The reversal of 11015330631043 is 34013603351011.
It is a cyclic number.
It is not a de Polignac number, because 11015330631043 - 213 = 11015330622851 is a prime.
It is a super-2 number, since 2×110153306310432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11015330630996 and 11015330631014.
It is not an unprimeable number, because it can be changed into a prime (11015330631047) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11007105 + ... + 11966077.
It is an arithmetic number, because the mean of its divisors is an integer number (723194898516).
Almost surely, 211015330631043 is an apocalyptic number.
11015330631043 is a deficient number, since it is larger than the sum of its proper divisors (555787745213).
11015330631043 is a wasteful number, since it uses less digits than its factorization.
11015330631043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 962334.
The product of its (nonzero) digits is 9720, while the sum is 31.
Adding to 11015330631043 its reverse (34013603351011), we get a palindrome (45028933982054).
The spelling of 11015330631043 in words is "eleven trillion, fifteen billion, three hundred thirty million, six hundred thirty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •