Base | Representation |
---|---|
bin | 110000000110111110… |
… | …0101000011001011111 |
3 | 100212200002001000002011 |
4 | 1200031330220121133 |
5 | 3143041140304043 |
6 | 115243400412051 |
7 | 10315124551456 |
oct | 1401574503137 |
9 | 325602030064 |
10 | 103313213023 |
11 | 3a8a6685089 |
12 | 18033477027 |
13 | 9986069c17 |
14 | 50010b9b9d |
15 | 2a4a04c59d |
hex | 180df2865f |
103313213023 has 8 divisors (see below), whose sum is σ = 109361221200. Its totient is φ = 97430903808.
The previous prime is 103313212987. The next prime is 103313213027. The reversal of 103313213023 is 320312313301.
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 103313213023 - 233 = 94723278431 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103313212985 and 103313213003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103313213027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41423458 + ... + 41425951.
It is an arithmetic number, because the mean of its divisors is an integer number (13670152650).
Almost surely, 2103313213023 is an apocalyptic number.
103313213023 is a deficient number, since it is larger than the sum of its proper divisors (6048008177).
103313213023 is an equidigital number, since it uses as much as digits as its factorization.
103313213023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82849481.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 103313213023 its reverse (320312313301), we get a palindrome (423625526324).
The spelling of 103313213023 in words is "one hundred three billion, three hundred thirteen million, two hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •