Base | Representation |
---|---|
bin | 100100001010010… |
… | …0100000011011001 |
3 | 10010120010120102210 |
4 | 1020110210003121 |
5 | 4441104200410 |
6 | 320222145333 |
7 | 42032206602 |
oct | 11024440331 |
9 | 3116116383 |
10 | 1213350105 |
11 | 5729a4990 |
12 | 29a422249 |
13 | 1644b9b56 |
14 | b7206da9 |
15 | 717c6220 |
hex | 485240d9 |
1213350105 has 32 divisors (see below), whose sum is σ = 2169514368. Its totient is φ = 573939200.
The previous prime is 1213350097. The next prime is 1213350107. The reversal of 1213350105 is 5010533121.
It is not a de Polignac number, because 1213350105 - 23 = 1213350097 is a prime.
It is a super-2 number, since 2×12133501052 = 2944436954607022050, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1213350107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 82914 + ... + 96443.
It is an arithmetic number, because the mean of its divisors is an integer number (67797324).
Almost surely, 21213350105 is an apocalyptic number.
1213350105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1213350105 is a deficient number, since it is larger than the sum of its proper divisors (956164263).
1213350105 is a wasteful number, since it uses less digits than its factorization.
1213350105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179417.
The product of its (nonzero) digits is 450, while the sum is 21.
The square root of 1213350105 is about 34833.1753505189. The cubic root of 1213350105 is about 1066.5847683974.
Adding to 1213350105 its reverse (5010533121), we get a palindrome (6223883226).
The spelling of 1213350105 in words is "one billion, two hundred thirteen million, three hundred fifty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •