Base | Representation |
---|---|
bin | 110000000100000001… |
… | …1001011001111110011 |
3 | 100212102011211221100211 |
4 | 1200020003023033303 |
5 | 3142340322442311 |
6 | 115225503524551 |
7 | 10312513531312 |
oct | 1401003131763 |
9 | 325364757324 |
10 | 103214265331 |
11 | 3a855842231 |
12 | 180062b9757 |
13 | 996b7043a8 |
14 | 4dd1cc0279 |
15 | 2a41504821 |
hex | 18080cb3f3 |
103214265331 has 8 divisors (see below), whose sum is σ = 104519971584. Its totient is φ = 101916745800.
The previous prime is 103214265317. The next prime is 103214265347. The reversal of 103214265331 is 133562412301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103214265331 - 233 = 94624330739 is a prime.
It is a super-2 number, since 2×1032142653312 (a number of 23 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 = 103214265293 and 103214265302.
It is not an unprimeable number, because it can be changed into a prime (103214265311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2021305 + ... + 2071738.
It is an arithmetic number, because the mean of its divisors is an integer number (13064996448).
Almost surely, 2103214265331 is an apocalyptic number.
103214265331 is a deficient number, since it is larger than the sum of its proper divisors (1305706253).
103214265331 is a wasteful number, since it uses less digits than its factorization.
103214265331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4093361.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 103214265331 its reverse (133562412301), we get a palindrome (236776677632).
The spelling of 103214265331 in words is "one hundred three billion, two hundred fourteen million, two hundred sixty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •