Base | Representation |
---|---|
bin | 110000000011101010… |
… | …0100000011011010001 |
3 | 100212101022211101110001 |
4 | 1200013110200123101 |
5 | 3142324210000223 |
6 | 115224345410001 |
7 | 10312304535523 |
oct | 1400724403321 |
9 | 325338741401 |
10 | 103202031313 |
11 | 3a849946677 |
12 | 18002199901 |
13 | 996900ca24 |
14 | 4dd0417a13 |
15 | 2a403d99ad |
hex | 18075206d1 |
103202031313 has 4 divisors (see below), whose sum is σ = 103301937508. Its totient is φ = 103102125120.
The previous prime is 103202031301. The next prime is 103202031337. The reversal of 103202031313 is 313130202301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 313130202301 = 7 ⋅44732886043.
It can be written as a sum of positive squares in 2 ways, for example, as 99816187969 + 3385843344 = 315937^2 + 58188^2 .
It is a cyclic number.
It is not a de Polignac number, because 103202031313 - 29 = 103202030801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103202031353) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 49951548 + ... + 49953613.
It is an arithmetic number, because the mean of its divisors is an integer number (25825484377).
Almost surely, 2103202031313 is an apocalyptic number.
It is an amenable number.
103202031313 is a deficient number, since it is larger than the sum of its proper divisors (99906195).
103202031313 is an equidigital number, since it uses as much as digits as its factorization.
103202031313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99906194.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 103202031313 its reverse (313130202301), we get a palindrome (416332233614).
The spelling of 103202031313 in words is "one hundred three billion, two hundred two million, thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •