Base | Representation |
---|---|
bin | 10111011110001100101101… |
… | …011111011010110000001011 |
3 | 111112111201110020202020002101 |
4 | 113132030231133122300023 |
5 | 102012311124323420443 |
6 | 1003315202433014231 |
7 | 30513100056430552 |
oct | 2736145537326013 |
9 | 445451406666071 |
10 | 103230302170123 |
11 | 2a98a7a8403a57 |
12 | b6b28833b4377 |
13 | 457a763b3789b |
14 | 1b6c532410d99 |
15 | be03cc89d84d |
hex | 5de32d7dac0b |
103230302170123 has 2 divisors, whose sum is σ = 103230302170124. Its totient is φ = 103230302170122.
The previous prime is 103230302170111. The next prime is 103230302170139. The reversal of 103230302170123 is 321071203032301.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (321071203032301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103230302170123 - 241 = 101031278914571 is a prime.
It is a super-2 number, since 2×1032303021701232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103230302170091 and 103230302170100.
It is not a weakly prime, because it can be changed into another prime (103230302171123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51615151085061 + 51615151085062.
It is an arithmetic number, because the mean of its divisors is an integer number (51615151085062).
Almost surely, 2103230302170123 is an apocalyptic number.
103230302170123 is a deficient number, since it is larger than the sum of its proper divisors (1).
103230302170123 is an equidigital number, since it uses as much as digits as its factorization.
103230302170123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 28.
The spelling of 103230302170123 in words is "one hundred three trillion, two hundred thirty billion, three hundred two million, one hundred seventy thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •