Base | Representation |
---|---|
bin | 10000001100111100101… |
… | …001101110110100111010 |
3 | 10221102220202001202210120 |
4 | 100030330221232310322 |
5 | 121220233002233310 |
6 | 2211255000154110 |
7 | 143304303500415 |
oct | 20147451566472 |
9 | 3842822052716 |
10 | 1113414102330 |
11 | 39a218263682 |
12 | 15b954168936 |
13 | 80cc0bb842a |
14 | 3bc64c28b7c |
15 | 1de6844eb70 |
hex | 1033ca6ed3a |
1113414102330 has 16 divisors (see below), whose sum is σ = 2672193845664. Its totient is φ = 296910427280.
The previous prime is 1113414102323. The next prime is 1113414102347. The reversal of 1113414102330 is 332014143111.
It is a happy number.
It is a super-2 number, since 2×11134141023302 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1113414102330.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18556901676 + ... + 18556901735.
It is an arithmetic number, because the mean of its divisors is an integer number (167012115354).
Almost surely, 21113414102330 is an apocalyptic number.
1113414102330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1113414102330 is an abundant number, since it is smaller than the sum of its proper divisors (1558779743334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113414102330 is a wasteful number, since it uses less digits than its factorization.
1113414102330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37113803421.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 1113414102330 its reverse (332014143111), we get a palindrome (1445428245441).
The spelling of 1113414102330 in words is "one trillion, one hundred thirteen billion, four hundred fourteen million, one hundred two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •