Base | Representation |
---|---|
bin | 10111011010111111101111… |
… | …000010010011110101011011 |
3 | 111111201200100201102101001022 |
4 | 113122333233002103311123 |
5 | 102000204403010120443 |
6 | 1003030123155513055 |
7 | 30461146025504321 |
oct | 2732775702236533 |
9 | 444650321371038 |
10 | 103010211020123 |
11 | 2a905426717460 |
12 | b67809b2b878b |
13 | 4562a8a2a8594 |
14 | 1b61a13cbbd11 |
15 | bd97ea6a5e68 |
hex | 5dafef093d5b |
103010211020123 has 4 divisors (see below), whose sum is σ = 112374775658328. Its totient is φ = 93645646381920.
The previous prime is 103010211020111. The next prime is 103010211020141. The reversal of 103010211020123 is 321020112010301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 103010211020123 - 28 = 103010211019867 is a prime.
It is a super-2 number, since 2×1030102110201232 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103010211020153) 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, 4682282319086 + ... + 4682282319107.
It is an arithmetic number, because the mean of its divisors is an integer number (28093693914582).
Almost surely, 2103010211020123 is an apocalyptic number.
103010211020123 is a deficient number, since it is larger than the sum of its proper divisors (9364564638205).
103010211020123 is an equidigital number, since it uses as much as digits as its factorization.
103010211020123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9364564638204.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 103010211020123 its reverse (321020112010301), we get a palindrome (424030323030424).
The spelling of 103010211020123 in words is "one hundred three trillion, ten billion, two hundred eleven million, twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •