Base | Representation |
---|---|
bin | 1010011001100100010001… |
… | …1000001001000000101000 |
3 | 1111111010001112000222211221 |
4 | 2212121010120021000220 |
5 | 2444320022112333000 |
6 | 40152511250031424 |
7 | 2260050566246602 |
oct | 246310430110050 |
9 | 44433045028757 |
10 | 11434350121000 |
11 | 370930a606664 |
12 | 1348078878574 |
13 | 64c340445181 |
14 | 2b75d57d6172 |
15 | 14c678a6161a |
hex | a6644609028 |
11434350121000 has 64 divisors (see below), whose sum is σ = 26774976384000. Its totient is φ = 4570561057600.
The previous prime is 11434350120971. The next prime is 11434350121027. The reversal of 11434350121000 is 12105343411.
It is a super-2 number, since 2×114343501210002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2534020 + ... + 5412019.
It is an arithmetic number, because the mean of its divisors is an integer number (418359006000).
Almost surely, 211434350121000 is an apocalyptic number.
11434350121000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11434350121000 is an abundant number, since it is smaller than the sum of its proper divisors (15340626263000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11434350121000 is a wasteful number, since it uses less digits than its factorization.
11434350121000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7947499 (or 7947485 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 11434350121000 its reverse (12105343411), we get a palindrome (11446455464411).
The spelling of 11434350121000 in words is "eleven trillion, four hundred thirty-four billion, three hundred fifty million, one hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •