Base | Representation |
---|---|
bin | 10000001101101011100… |
… | …000001100001100011010 |
3 | 10221111221112010010111201 |
4 | 100031223200030030122 |
5 | 121223340213132310 |
6 | 2211504555344414 |
7 | 143332626562300 |
oct | 20155340141432 |
9 | 3844845103451 |
10 | 1114200130330 |
11 | 39a590a210a1 |
12 | 15bb3345210a |
13 | 810b79b8861 |
14 | 3bcdb398270 |
15 | 1deb2466e3a |
hex | 1036b80c31a |
1114200130330 has 24 divisors (see below), whose sum is σ = 2332998641268. Its totient is φ = 382011473088.
The previous prime is 1114200130273. The next prime is 1114200130331. The reversal of 1114200130330 is 330310024111.
It can be written as a sum of positive squares in 2 ways, for example, as 1079963659369 + 34236470961 = 1039213^2 + 185031^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1114200130298 and 1114200130307.
It is not an unprimeable number, because it can be changed into a prime (1114200130331) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1136938419 + ... + 1136939398.
Almost surely, 21114200130330 is an apocalyptic number.
1114200130330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1114200130330 is an abundant number, since it is smaller than the sum of its proper divisors (1218798510938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1114200130330 is a wasteful number, since it uses less digits than its factorization.
1114200130330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2273877838 (or 2273877831 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1114200130330 its reverse (330310024111), we get a palindrome (1444510154441).
The spelling of 1114200130330 in words is "one trillion, one hundred fourteen billion, two hundred million, one hundred thirty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •